Title of article
AN ALGORITHMIC APPROACH TO EQUITABLE EDGE CHROMATIC NUMBER OF GRAPHS
Author/Authors
VIVIK J, VENINSTINE Department of Mathematics - Karunya University - Coimbatore - Tamil Nadu, India , G, GIRIJA Department of Mathematics - Government Arts College - Coimbatore - Tamil Nadu, India
Pages
10
From page
374
To page
383
Abstract
The equitable edge chromatic number is the minimum number of colors
required to color the edges of graph G, for which G has a proper edge coloring and if the
number of edges in any two color classes differ by at most one. In this paper, we obtain
the equitable edge chromatic number of Sn, Wn, Hn and Gn.
Keywords
Equitable edge coloring , Wheel , Helm , Gear , Sunlet
Journal title
Turkish World Mathematical Society Journal of Applied and Engineering Mathematics
Serial Year
2019
Record number
2584901
Link To Document