Equitable edge chromatic number of P_{m}⊗S_{n}⁰ and S_{m}⁰⊗S_{n}⁰

Authors : J. VENİNSTİNE VİVİK

Pages : 1294-1300

Doi:10.31801/cfsuasmas.524481

View : 6 | Download : 5

Publication Date : 2019-08-01

Article Type : Research Paper

Abstract :The equitable edge chromatic number is the minimum number of colors required to color the edges of a graph G and satisfies the criterion, if for each vertex v∈Vinsert ignore into journalissuearticles values(G);, the number of edges of any one color incident with v differs 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 P_{m} coupled with Crown S_{n}⁰ and also two Crown graphs S_{m}⁰ along with S_{n}⁰ are obtained.
Keywords : Equitable edge coloring, tensor product, Crown graph