Disproof of a conjecture on the subdivision domination number of a graph
From MaRDI portal
Publication:1014812
DOI10.1007/s00373-008-0788-6zbMath1193.05124OpenAlexW1998317224WikidataQ122973176 ScholiaQ122973176MaRDI QIDQ1014812
Odile Favaron, Hossein Karami, Seyyed Mahmoud Sheikholeslami
Publication date: 29 April 2009
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-008-0788-6
Related Items (9)
On domination multisubdivision number of unicyclic graphs ⋮ Bounding the total domination subdivision number of a graph in terms of its order ⋮ Some graphs with double domination subdivision number three ⋮ Coronas and domination subdivision number of a graph ⋮ An upper bound for the total domination subdivision number of a graph ⋮ Independent domination subdivision in graphs ⋮ Domination subdivision and domination multisubdivision numbers of graphs ⋮ On the Roman domination subdivision number of a graph ⋮ Total domination multisubdivision number of a graph
Cites Work
This page was built for publication: Disproof of a conjecture on the subdivision domination number of a graph