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

Home Page
About
Submit A Journal
Submit A Conference
Submit Paper/Book
- Submit a Preprint
- Submit a Book
Contact

Communications Faculty of Sciences University Ankara Series A1 Mathematics and Statistics
Volume:68 Issue:2
Equitable edge chromatic number of P_{m}⊗S_{n}⁰ and S_{m}⁰⊗S_{n}⁰

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

Pages : 1294-1300

View : 45 | Download : 6

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

ORIGINAL ARTICLE URL

* There may have been changes in the journal, article,conference, book, preprint etc. informations. Therefore, it would be appropriate to follow the information on the official page of the source. The information here is shared for informational purposes. IAD is not responsible for incorrect or missing information.