On graphs for which the connected domination number is at most the total domination number

DOI10.1016/J.DAM.2011.12.025zbMATH Open1242.05211OpenAlexW2048253143MaRDI QIDQ423952FDOQ423952

Authors: Oliver Schaudt 

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

Recommendations

• On graphs with equal total domination and connected domination numbers
• On graphs with equal total domination and connected domination numbers
• scientific article; zbMATH DE number 1529462
• scientific article; zbMATH DE number 3873384
• The structure of dominating subgraphs

zbMATH Keywords

total dominationconnected dominationpaired-dominationperfection of parameters

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Title not available (Why is that?)
• Total domination in graphs
• A survey of selected recent results on total domination in graphs
• Paired-domination in graphs
• Dominating sets for split and bipartite graphs
• A semi-induced subgraph characterization of upper domination perfect graphs
• Perfect connected-dominant 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
• Title not available (Why is that?)

Cited In (18)

• [1,2]-Complementary connected domination number of graphs-III
• Linear separation of connected dominating sets in graphs
• Connected domination in maximal outerplanar graphs
• Title not available (Why is that?)
• Extremal connected graphs for independent domination number
• On graphs with equal total domination and connected domination numbers
• The structure of dominating subgraphs
• The price of connectivity for dominating set: upper bounds and complexity
• Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width
• Forbidden subgraphs for constant domination number
• Bounds on the connected domination number of a graph
• On the existence of total dominating subgraphs with a prescribed additive hereditary property
• Domination parameters of a graph and its complement
• 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
• Relating the size of a connected graph to its total and restricted domination numbers
• Totally connected domination in graphs
• Connected domination

This page was built for publication: On graphs for which the connected domination number is at most the total domination number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q423952)