On r- dynamic coloring of the family of bistar graphs

Authors : G NANDİNİ, M VENKATACHALAM, S GOWRİ

Pages : 923-928

Doi:10.31801/cfsuasmas.489727

View : 11 | Download : 11

Publication Date : 2019-02-01

Article Type : Research Paper

Abstract :An r-dynamic coloring of a graph G is a proper coloring c of the vertices such that |cinsert ignore into journalissuearticles values(Ninsert ignore into journalissuearticles values(v););|≥min{r,dinsert ignore into journalissuearticles values(v);}, for each v∈Vinsert ignore into journalissuearticles values(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.
Keywords : r dynamic coloring, bistar graph, middle graph, total graph, central graph and line graph