<i>d-Distance</i>Coloring of Generalized Petersen Graphs <i>P(n, k)</i>

• 作者: Ramy Shaheen Samar Jakhlab Ziad Kanaya
• 来源期刊: 离散数学期刊(英文)
• 学科: 数学
• 关键词: DISTANCE COLORING Generalized Petersen GRAPHS
• 年，卷（期）: 2017,（4）
• 页码范围: 185-199
• 页数: 15页
• 分类号: O1

摘要

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.