δ-Dynamic chromatic number of Helm graph families
N. Mohanapriya, J. Vernold Vivin, Mathiyazhagan Venkatachalam · Cogent Mathematics · 2016
An r-dynamic coloring of a graph G is a proper coloring c of the vertices such that c(N(v))≥minr,d(v), for each v∈V(G), where N(v) and d(v) denote the neighborhood and the degree of v, respectively. 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 δ-dynamic chromatic number of middle, total, and central of helm graph, where δ=minv∈V(G)d(v).