Disprove of a conjecture on the doubly connected domination subdivision number
From MaRDI portal
Publication:2169241
DOI10.1007/s41980-021-00586-8zbMath1494.05085WikidataQ113890902 ScholiaQ113890902MaRDI QIDQ2169241
Zehui Shao, Saeed Kosari, Lutz Volkmann, Hossein Karami, Seyyed Mahmoud Sheikholeslami
Publication date: 2 September 2022
Published in: Bulletin of the Iranian Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s41980-021-00586-8
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Cites Work
- Unnamed Item
- Inequalities of Nordhaus-Gaddum type for doubly connected domination number
- Bounds on the connected domination number of a graph
- On the doubly connected domination number of a graph
- Connected Domination
- On the doubly connected domination polynomial of a graph
- Distance-transitive graphs of valency 5, 6 and 7