EQUITABLE EDGE COLORING OF PRISM GRAPH FAMILIES

An equitable edge coloring of G is an assignment of colors to all the edge of a graph G for which no two adjacent edges got the same colors and difference for any two color classes by at most one. The minimum number of colors required for such coloring is called as the equitable edge chromatic number. In this paper, we prove the results on equitable edge chromatic number for prism graph, anti-prism graph and n-crossed prism graph.