On r−Dynamic chromatic number of some brick product graphs C(2n, 2, p)
Palestine Journal of Mathematics, cilt.15, sa.Special Issue II, ss.45-54, 2026 (Scopus)
- Yayın Türü: Makale / Tam Makale
- Cilt numarası: 15 Sayı: Special Issue II
- Basım Tarihi: 2026
- Dergi Adı: Palestine Journal of Mathematics
- Derginin Tarandığı İndeksler: Scopus
- Sayfa Sayıları: ss.45-54
- Anahtar Kelimeler: brick product graph, r−dynamic coloring
- Bursa Uludağ Üniversitesi Adresli: Evet
Özet
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.