✨
Yapay Zeka Hızlı Bakış & Çıkarımlar
AI Insight⚡ TL;DR(1 Cümlede Hızlı Çıkarım)
In this paper, we obtain the r-dynamic chromatic number of middle, total, central and line graph of Bistar graph.
📌 3 Maddede Bu Makale
🎯
Amaç & Hipotez: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).
📊
Temel Bulgular & Veri:The r-dynamic chromatic number of a graph G is the minimum k such that G has an r-dynamic coloring with k colors.
💡
Sonuç & Katkı:In this paper, we obtain the r-dynamic chromatic number of middle, total, central and line graph of Bistar graph.
🔬Tür:Research Article
📍Kapsam:Genişletilmiş Akademik Örneklem
⚙️Değişkenler:r-dynamic coloring · bistar graph · middle graph
Abstract
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.
🔖
Bu Makaleye Atıf Yap
Nandini, G., Venkatachalam, M., Gowri, S. (2019). On r- dynamic coloring of the family of bistar graphs. Communications Faculty of Sciences University of Ankara Series A1 Mathematics and Statistics, Volume: 68 Issue: 1. https://doi.org/10.31801/cfsuasmas.489727