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

DOI10.1016/J.DAM.2011.12.025MaRDI QIDQ423952zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

connected dominationpaired-dominationperfection of parameterstotal domination

Mathematics Subject Classification ID

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

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

Cites work

• A semi-induced subgraph characterization of upper domination perfect graphs
• A survey of selected recent results on total domination in graphs
• Complete description of forbidden subgraphs in the structural domination problem
• Dominating sets for split and bipartite graphs
• Hereditary Domination in Graphs: Characterization with Forbidden Induced Subgraphs
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 2114467 (Why is no real title available?)
• On graphs with equal total domination and connected domination numbers
• Paired-domination in graphs
• Perfect connected-dominant graphs
• Total domination in graphs

Cited in

(18)

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

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)