On graphs for which the connected domination number is at most the total domination number
From MaRDI portal
Publication:423952
DOI10.1016/j.dam.2011.12.025zbMath1242.05211OpenAlexW2048253143MaRDI QIDQ423952
Publication date: 30 May 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.12.025
Related Items (9)
The price of connectivity for dominating set: upper bounds and complexity ⋮ Connected domination in maximal outerplanar graphs ⋮ Domination parameters of a graph and its complement ⋮ Bounds on the connected domination number of a graph ⋮ Price of connectivity for the vertex cover problem and the dominating set problem: conjectures and investigation of critical graphs ⋮ On a class of graphs between threshold and total domishold graphs ⋮ Connected Domination ⋮ Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width ⋮ Linear separation of connected dominating sets in graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Dominating sets for split and bipartite graphs
- A survey of selected recent results on total domination in graphs
- Complete description of forbidden subgraphs in the structural domination problem
- On graphs with equal total domination and connected domination numbers
- Hereditary Domination in Graphs: Characterization with Forbidden Induced Subgraphs
- Total domination in graphs
- A semi-induced subgraph characterization of upper domination perfect graphs
- Perfect connected-dominant graphs
- Paired-domination in graphs
This page was built for publication: On graphs for which the connected domination number is at most the total domination number
