Dominating sets inducing large components

DOI10.1016/j.disc.2016.05.016zbMath1339.05275OpenAlexW2434788344MaRDI QIDQ2629281

Dieter Rautenbach, Simone Dantas, José D. Alvarado

Publication date: 5 July 2016

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2016.05.016

zbMATH Keywords

dominationtotal domination

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07)

Related Items

3-component domination numbers in graphs ⋮ Dominating sets inducing large component in graphs with minimum degree two

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Total domination in maximal outerplanar graphs. II.
• Total domination in graphs with given girth
• On graphs having domination number half their order
• Dominating sets in planar graphs
• Domination in graphs of minimum degree at least two and large girth
• Graph-theoretic parameters concerning domination, independence, and irredundance
• Domination in graphs with minimum degree two
• Total domination in graphs
• Domination-balanced graphs
• Graphs with large total domination number
• Dominating sets inducing large components in maximal outerplanar graphs
• Total Domination in Graphs