On r- dynamic coloring of the family of bistar graphs
G. Nandini, Mathiyazhagan Venkatachalam, S. Gowri · Communications Faculty Of Science University of Ankara Series A1Mathematics and Statistics · 2018
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.