Strong edge chromatic index of the generalized Petersen graphs

Zixuan Yang and Baoyindureng Wu

Applied Mathematics and Computation, 2018, vol. 321, issue C, 431-441

Abstract: A strong edge coloring of a graph G is an assignment of colors to the edges of G such that two distinct edges are colored differently if they are adjacent to a common edge or share an endpoint. The strong chromatic index of a graph G, denoted by χs′(G), is the minimum number of colors needed for a strong edge coloring of G. We determine the strong chromatic index of the generalized Petersen graphs P(n, k) when 1 ≤ k ≤ 3.

Keywords: Strong edge coloring; Strong chromatic index; Generalized Petersen graphs (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300317307464
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:321:y:2018:i:c:p:431-441

DOI: 10.1016/j.amc.2017.10.047

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().