An equitable edge coloring of some classes of product of graphs
Authors :
K. Manikandan 1 , S. Moidhen Aliyar 2 * and S. Manimaran 3
Author Address :
1 Department of Mathematics, Guru Nanak College, Chennai-600042, Tamil Nadu, India.
2 Department of Mathematics, The New College, Chennai-600 014, Tamilnadu, India.
3 Department of Mathematics, RKM Vivekananda College, Chennai-600004, Tamil Nadu, India.
*Corresponding author.
Abstract :
An equitable edge coloring for any graph $G$ is an assignment of colors to all the edges of graph $G$ such that adjacent edges receive the different color and for any two color classes different by at most one. In this paper, we prove theorem on equitable edge coloring for strong products of path and cycle.
Keywords :
Equitable edge coloring, Strong product, Cycle graph.
DOI :
Article Info :
Received : April 11, 2020; Accepted : August 22, 2020.
