On the star chromatic index of generalized Petersen graphs
Author(s) -
Zehui Shao,
Enqiang Zhu
Publication year - 2019
Publication title -
discussiones mathematicae graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.476
H-Index - 19
eISSN - 2083-5892
pISSN - 1234-3099
DOI - 10.7151/dmgt.2195
Subject(s) - mathematics , star (game theory) , combinatorics , edge coloring , index (typography) , chromatic scale , petersen graph , graph , line graph , computer science , mathematical analysis , voltage graph , world wide web , graph power
The star k-edge-coloring of graph G is a proper edge coloring using k colors such that no path or cycle of length four is bichromatic. The minimum number k for which G admits a star k-edge-coloring is called the star chromatic index of G, denoted by χ′s (G). Let GCD(n, k) be the greatest common divisor of n and k. In this paper, we give a necessary and sufficient condition of χ′s (P (n, k)) = 4 for a generalized Petersen graph P (n, k) and show that “almost all” generalized Petersen graphs have a star 5-edge-colorings. Furthermore, for any two integers k and n (≥2k + 1) such that GCD(n, k) ≥ 3, P (n, k) has a star 5-edge-coloring, with the exception of the case that GCD(n, k) = 3, k ≠ GCD(n, k) and n3≡1(mod3){n \over 3} \equiv 1\left( {\bmod 3} \right).
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom