EQUITABLE EDGE COLORING ON TENSOR PRODUCT OF GRAPHS

A graph G is edge colored if different colors are assigned to its edges or lines, in the order of neighboring edges are allotted with least diverse k-colors. If each of k-colors can be partitioned into color sets and differs by utmost one, then it is equitable. The minimum of k-colors required is known as equitably edge chromatic number and symbolized by chi'=(G). Further the impression of equitable edge coloring was.rst initiated by Hilton and de Werra in 1994. In this paper, we ascertain the equitable edge chromatic number of P-m circle times P-n, P-m circle times C-n and K-1,K-m circle times K-1,K-n.