Abstract
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.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have