An equitable edge coloring of some classes of product of graphs
Year: 2020
Type: article
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.
Source: Malaya Journal of Matematik
Authors: K. Manikandan, S. Moidhen Aliyar, S. Manimaran
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W3083390394