Equitable Edge Coloring of Splitting Graph of Some Classes of Wheel Graphs
Ars Combinatoria · 2023
DOI: 10.61091/ars156-05 ↗Kurz gefasst
Fachartikel in der Zeitschrift Ars Combinatoria, 2023. Verfasst von Jagannathan M und 2 weiteren Autor:innen.
Abstract (Originalsprache)
The coloring of all the edges of a graph \(G\) with the minimum number of colors, such that the adjacent edges are allotted a different color is known as the proper edge coloring. It is said to be equitable, if the number of edges in any two color classes differ by atmost one. In this paper, we obtain the equitable edge coloring of splitting graph of \(W_n\), \(DW_n\) and \(G_n\) by determining its edge chromatic number.
Zitieren
APA
M, J., J, V. V., & J, V. V. (2023). Equitable Edge Coloring of Splitting Graph of Some Classes of Wheel Graphs. Ars Combinatoria. https://doi.org/10.61091/ars156-05
Vancouver
M J, J VV, J VV. Equitable Edge Coloring of Splitting Graph of Some Classes of Wheel Graphs. Ars Combinatoria. 2023. doi:10.61091/ars156-05
BibTeX
@article{M2023,
author = {M, Jagannathan and J, Vernold Vivin and J, Veninstine Vivik},
title = {Equitable Edge Coloring of Splitting Graph of Some Classes of Wheel Graphs},
journal = {Ars Combinatoria},
year = {2023},
doi = {10.61091/ars156-05}
}
EUVIMED