On r - dynamic coloring of some graphs
V. Aparna, Mohanapriya Nagaraj · Kongunadu Research Journal · 2020
The r-dynamic coloring of a graph is a proper p-coloring of the vertices of the graph H so that for every vertex has neighbors in atleast distinct classes of color.The least p which provides H an r-dynamic coloring with p colors is known as r-dynamic chromatic number of the graph H and it is denoted as .In this paper, we have attained the lower, upper bound and exact rdynamic chromatic number for cocktail party graph , s-barbell graph , windmill graph , book graph and pencil graph .