On Equitable Edge Coloring of Wheel Graph Families

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 theorem on equitable edge coloring for sunlet graph, wheel graph and helm graph.