Chromatic connected domination in graphs

DOI10.1080/09720529.2019.1681692MaRDI QIDQ5036675zbMATH OpenOpenAlexFDO

Authors S. Balamurugan, M. S. Anitha, S. Kalaiselvi

Publication date 23 February 2022

Published in Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/09720529.2019.1681692

zbMATH Keywords

connected dominationchromatic connected dominationchromatic connected domination number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Chromatic total domination in graphs
• Further results on global connected domination number of graphs
• scientific article; zbMATH DE number 3873384
• Chromatic transversal domination in graphs
• On graphs with equal chromatic transversal domination and connected domination numbers

Cites work

• scientific article; zbMATH DE number 3702724 (Why is no real title available?)
• Complementary total domination in graphs
• Graph theory with applications
• Inverse total domination in graphs

Cited in

(8)

• Some characterization theorems on dominating chromatic partition-covering number of graphs
• scientific article; zbMATH DE number 7295283 (Why is no real title available?)
• scientific article; zbMATH DE number 7057230 (Why is no real title available?)
• Chromatic total domination in graphs
• Chromatic transversal domination in graphs
• On chromatic transversal domination in graphs
• A note on the chromatic transversal domination number of a class of graphs
• Chromatic transversal domatic number of graphs

This page was built for publication: Chromatic connected domination in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5036675)