VENİNSTİNE, Vivik JAKBAR ALI, M. M.GIRIJA, G.2021-11-292021-11-292020-12-31https://doi.org/10.31801/cfsuasmas.716392http://hdl.handle.net/20.500.12575/76426A 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 χ ′ = ( G ) . Further the impression of equitable edge coloring was first initiated by Hilton and de Werra in 1994. In this paper, we ascertain the equitable edge chromatic number of P m ⊗ P n , P m ⊗ C n and K 1 , m ⊗ K 1 , n .enEquitable edge coloringTensor productArticle692133613442618-6470