Strong chromatic index of generalized Jahangir graphs and generalized Helm graphs
Keyword(s):
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.
2020 ◽
Vol 12
(04)
◽
pp. 2050035
Keyword(s):
2019 ◽
Vol 11
(06)
◽
pp. 1950064
Keyword(s):
Keyword(s):
2007 ◽
Vol Vol. 9 no. 1
(Graph and Algorithms)
◽
2013 ◽
Vol 333-335
◽
pp. 1452-1455
Keyword(s):
2012 ◽
Vol Vol. 14 no. 2
(Graph Theory)
◽
Keyword(s):
Keyword(s):