On r- Dynamic coloring of the gear graph families
Author
Deepa, T.
Venkatachalam, M.
Dafik, D.
Full text
https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/376710.22199/issn.0717-6279-2021-01-0001
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 the middle, central and line graphs of the gear graph.
Metadata
Show full item recordRelated items
Showing items related by title, author, creator and subject.
-
Graceful centers of graceful graphs and universal graceful graphs.
Makadia, H. M.; Karavadiya, H. M.; Kaneria, V. J.. Proyecciones. Journal of Mathematics; Vol 38 No 2 (2019); 305-314 -
Equitable Graph of a Graph
Dharmalingam, Kuppusamy Makandan. Proyecciones. Journal of Mathematics; Vol 31 No 4 (2012); 363-372 -
Irregularity indices for line graph of Dutch windmill graph
Mohammed, Mohanad A.; AL-Mayyahi, Suad Younus A. AL-Mayyahi; Virk, Abaid ur Rehman; Rehman, Hafiz Mutee ur. Proyecciones (Antofagasta, On line); Vol. 39 No. 4 (2020): Special Issue: Mathematical Computation in Combinatorics and Graph Theory; 903-918