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∈V(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.
Birincil Dil | İngilizce |
---|---|
Konular | Matematik |
Bölüm | Makaleler |
Yazarlar | |
Yayımlanma Tarihi | 1 Ağustos 2019 |
Gönderilme Tarihi | 5 Şubat 2018 |
Kabul Tarihi | 25 Haziran 2018 |
Yayımlandığı Sayı | Yıl 2019 Cilt: 68 Sayı: 2 |
Communications Faculty of Sciences University of Ankara Series A1 Mathematics and Statistics.
This work is licensed under a Creative Commons Attribution 4.0 International License.