EQUITABLE EDGE COLORING OF DEGREE SPLITTING GRAPH OF SOME GRAPHS

Vimala Varshini, M and Jayaraman, G (2025) EQUITABLE EDGE COLORING OF DEGREE SPLITTING GRAPH OF SOME GRAPHS. In: Global Conference on Computational Mathematics and Intelligent Engineering Applications (GCCMIEA 2025), Dec 27 to29 _2025, Thailand.

[thumbnail of GCCMIEA-Conf_Proc_Vima_Jay-2025.pdf]

Text
GCCMIEA-Conf_Proc_Vima_Jay-2025.pdf - Published Version
Download (731kB)

Abstract

An equitable edge coloring of a graph is a proper edge coloring for which the difference between any two color classes is at most one. The minimum cardinality of G for such
coloring is called equitable edge chromatic number. In this article, we determine the equitable edge chromatic number of degree splitting graph of ladder, sunlet, comb, bistar, shell and fan graph.

Item Type:	Conference or Workshop Item (Paper)
Subjects:	Mathematics > Graph Theory
Domains:	Mathematics
Depositing User:	IR Admin
Date Deposited:	03 Sep 2026 08:55
Last Modified:	03 Sep 2026 08:55
URI:	https://ir.vistas.ac.in/id/eprint/22470

Actions (login required)

: View Item