On r- Dynamic coloring of the gear graph families

• Deepa, T. ^[1] ; Venkatachalam, M. ^[1] ; Dafik, D. ^[2]
  1. [1] Kongunadu Arts and Science College (Autonomous).
  2. [2] University of Jember.
• Localización: Proyecciones: Journal of Mathematics, ISSN 0716-0917, ISSN-e 0717-6279, Vol. 40, Nº. 1, 2021, págs. 1-15
• Idioma: inglés
• Enlaces
  • Texto completo
• Resumen

  • 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 the middle, central and line graphs of the gear graph.