A proof of a conjecture on the connected domination number

DOI10.1007/s40840-022-01390-1zbMath1501.05020OpenAlexW4296198041WikidataQ114218355 ScholiaQ114218355MaRDI QIDQ2091175

Saeed Kosari, Zehui Shao, Mustapha Chellali, Rana Khoeilar, Hossein Karami, Seyyed Mahmoud Sheikholeslami

Publication date: 31 October 2022

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40840-022-01390-1

zbMATH Keywords

forbidden induced subgraphsconnected dominating setconnected domination number

Mathematics Subject Classification ID

Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• A new characterization of \(P_k\)-free graphs
• The price of connectivity for dominating set: upper bounds and complexity
• Connected dominating set. Theory and applications
• Dominating cliques in \(P_ 5\)-free graphs
• Connected Domination
• Dominating cliques in graphs

This page was built for publication: A proof of a conjecture on the connected domination number