On r-dynamic chromatic number of some brick product graphs C(2n, 1, p)
T. Deepa, Mathiyazhagan Venkatachalam, İsmail Naci Cangül · Asian-European Journal of Mathematics · 2021
An r-dynamic coloring of a graph G is a proper coloring c of the vertices such that [Formula: see text] for each vertex [Formula: see text]. 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 brick product graphs.