An r-dynamic coloring of a graph G is a proper coloring c of the vertices such that |c(N(v))|≥min{r,d(v)}, for each v∈V(G). The r-dynamic chromatic number of a graph G is the minimum k such that G has an r-dynamic coloring with k colors. In this paper, we obtain the r-dynamic chromatic number of middle, total, central and line graph of Bistar graph.
r-dynamic coloring bistar graph middle graph total graph central graph and line graph
Birincil Dil | İngilizce |
---|---|
Konular | Matematik |
Bölüm | Makaleler |
Yazarlar | |
Yayımlanma Tarihi | 1 Şubat 2019 |
Gönderilme Tarihi | 14 Şubat 2018 |
Kabul Tarihi | 26 Mayıs 2018 |
Yayımlandığı Sayı | Yıl 2019 Cilt: 68 Sayı: 1 |
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.