Let chi(i)(G) denote the incidence coloring number of a graph G. In this paper, we study the incidence coloring on generalized Petersen graphs GP(n, k). We first assure that 4 <= chi(i)(GP(n, k)) <= 5. Furthermore, we provide the following results: (i) chi(i)(GP(n, k)) = 5 if n is odd, (ii) chi(i)(GP(n, 2)) = 5, and (iii) chi(i)(GP(n, k)) = 4 if n equivalent to 0 (mod 4) and k is odd.
机构:
China Univ Min & Technol, Sch Math, Xuzhou 221116, Jiangsu, Peoples R ChinaChina Univ Min & Technol, Sch Math, Xuzhou 221116, Jiangsu, Peoples R China
Chen, Ming
Miao, Lianying
论文数: 0引用数: 0
h-index: 0
机构:
China Univ Min & Technol, Sch Math, Xuzhou 221116, Jiangsu, Peoples R ChinaChina Univ Min & Technol, Sch Math, Xuzhou 221116, Jiangsu, Peoples R China
Miao, Lianying
Zhou, Shan
论文数: 0引用数: 0
h-index: 0
机构:
Jiangsu Normal Univ, Sch Math & Stat, Xuzhou 221116, Jiangsu, Peoples R ChinaChina Univ Min & Technol, Sch Math, Xuzhou 221116, Jiangsu, Peoples R China
机构:
Capital Normal Univ, Dept Math, Beijing 100037, Peoples R ChinaCapital Normal Univ, Dept Math, Beijing 100037, Peoples R China
Li, Deming
Liu, Mingju
论文数: 0引用数: 0
h-index: 0
机构:
Beihang Univ, LMIB, Beijing 100083, Peoples R China
Beihang Univ, Dept Math, Beijing 100083, Peoples R ChinaCapital Normal Univ, Dept Math, Beijing 100037, Peoples R China