✨
AI Summary & Key Takeaways
AI Insight⚡ TL;DR(Too Long; Didn't Read)
In this paper, we obtain the r-dynamic chromatic number of middle, total, central and line graph of Bistar graph.
📌 3 Key Takeaways
🎯
Objective & Hypothesis: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).
📊
Key Findings & Data:The r-dynamic chromatic number of a graph G is the minimum k such that G has an r-dynamic coloring with k colors.
💡
Conclusion & Impact:In this paper, we obtain the r-dynamic chromatic number of middle, total, central and line graph of Bistar graph.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables: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.
🔖
Cite This Article
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