Strong chromatic index of generalized Jahangir graphs and generalized Helm graphs

被引:1
|
作者
Thiru, Vikram Srinivasan [1 ]
Balaji, S. [1 ]
机构
[1] SASTRA Deemed Univ, Dept Math, Thanjavur, Tamil Nadu, India
关键词
Strong edge-coloring; strong chromatic index; induced matchings; Jahangir graph; wheel graph; Helm graph;
D O I
10.1142/S1793830922500458
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The strong edge coloring of a graph G is a proper edge coloring that assigns a different color to any two edges which are at most two edges apart. The minimum number of color classes that contribute to such a proper coloring is said to be the strong chromatic index of G. This paper defines the strong chromatic index for the generalized Jahangir graphs and the generalized Helm graphs.
引用
收藏
页数:7
相关论文
共 50 条