Author(s)

Ramy Shaheen, Ziad Kanaya, Samar Jakhlab

Department of Mathematics, Faculty of Science, Tishreen University, Lattakia, Syria.

A coloring of G is d-distance if any two vertices at distance at most d from each other get different colors. The minimum number of colors in d-distance colorings of G is its d-distance chromatic number, denoted by χ_d(G). In this paper, we give the exact value of χ_d(G) (d = 1, 2), for some types of generalized Petersen graphs P(n, k) where k = 1, 2, 3 and arbitrary n.

Distance Coloring, Generalized Petersen Graphs

Shaheen, R. , Kanaya, Z. and Jakhlab, S. (2017) d-Distance Coloring of Generalized Petersen Graphs P(n, k). Open Journal of Discrete Mathematics, 7, 185-199. doi: 10.4236/ojdm.2017.74017.