Ir al contenido

Documat


Resumen de On r- Dynamic coloring of the gear graph families

T. Deepa, M. Venkatachalam, D. Dafik

  • 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.


Fundación Dialnet

Mi Documat