On r -dynamic chromatic number of some brick product graphs C (2n, 1, p)

Deepa T., Venkatachalam M., CANGÜL İ. N.

Asian-European Journal of Mathematics, cilt.15, 2022 (ESCI) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 15
  • Basım Tarihi: 2022
  • Doi Numarası: 10.1142/s1793557122501029
  • Dergi Adı: Asian-European Journal of Mathematics
  • Derginin Tarandığı İndeksler: Emerging Sources Citation Index (ESCI), Scopus, zbMATH
  • Anahtar Kelimeler: r-dynamic coloring, brick product graph
  • Bursa Uludağ Üniversitesi Adresli: Evet

Özet

© 2022 World Scientific Publishing Company.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 vertex 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.