On the Equitable Adjacent Strong Edge Coloring of K(n,m)
Jing Wen Li, Zhi Peng Chen, Guang Hui Yan · Applied Mechanics and Materials · 2012
For a graph G(V,E),then is called k-adjacent strong edge coloring of G, is abbreviated k-ASEC, if a k-ASEC of G satisfies then f is called k-equitable adjacent strong edge coloring of G, is called k-EASC for short, and is called the equitable adjacent strong edge chromatic number of G. In this paper, we have proved the equitable adjacent strong edge chromatic number of graph K(n,m) , with n≥ 2,n≡0(mod 2), m≥ 1.