EQUITABLE EDGE CHROMATIC NUMBER OF Pm S0n ANDS0m S0n

Abstract

The equitable edge chromatic number is the minimum number of colors required to color the edges of a graph G and satisÖes the criterion, if for each vertex v 2 V (G), the number of edges of any one color incident with v di§ers from the number of edges of any other color incident with v by atmost one. In this paper, the equitable edge chromatic number of tensor product of Path Pm coupled with Crown S 0 n and also two Crown graphs S 0m along with S 0 n are obtained.