Design Thinking on δ-Dynamic Coloring of Central Vertex Join of Graphs

Abstract

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 δ-dynamic chromatic number of the central vertex join of two graphs.