On r− dynamic coloring of the gear graph families

DOI10.22199/issn.0717-6279-2021-01-0001zbMath1478.05051OpenAlexW3110112243MaRDI QIDQ5027695

M. Venkatachalam, T. Deepa, D. Dafik

Publication date: 7 February 2022

Published in: Proyecciones (Antofagasta) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.22199/issn.0717-6279-2021-01-0001

zbMATH Keywords

middle graph\(r\)-dynamic coloringgear graphcentral graph and line graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Optimal secret share distribution in degree splitting communication networks

Cites Work

• On the difference between chromatic number and dynamic chromatic number of graphs
• Dynamic chromatic number of regular graphs
• Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number
• On \(r\)-dynamic chromatic number of graphs
• The 2nd-order conditional 3-coloring of claw-free graphs
• On the list dynamic coloring of graphs
• Complexity of conditional colorability of graphs
• δ-Dynamic chromatic number of Helm graph families
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On r− dynamic coloring of the gear graph families