Chromatic connected domination in graphs
From MaRDI portal
Publication:5036675
DOI10.1080/09720529.2019.1681692zbMATH Open1495.05209OpenAlexW2992547833MaRDI QIDQ5036675FDOQ5036675
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
Recommendations
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15)
Cites Work
Cited In (8)
- Title not available (Why is that?)
- Chromatic total domination in graphs
- Some characterization theorems on dominating chromatic partition-covering number of graphs
- Chromatic transversal domination in graphs
- Chromatic transversal domatic number of graphs
- On chromatic transversal domination in graphs
- A note on the chromatic transversal domination number of a class of graphs
- Title not available (Why is that?)
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)