On r−Dynamic chromatic number of some brick product graphs C(2n, 2, p)
Palestine Journal of Mathematics, vol.15, no.Special Issue II, pp.45-54, 2026 (Scopus)
- Publication Type: Article / Article
- Volume: 15 Issue: Special Issue II
- Publication Date: 2026
- Journal Name: Palestine Journal of Mathematics
- Journal Indexes: Scopus
- Page Numbers: pp.45-54
- Keywords: brick product graph, r−dynamic coloring
- Bursa Uludag University Affiliated: Yes
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 r− dynamic chromatic number of brick product graphs.