Connected domination versus dominating sets inducing large components

DOI10.1016/J.DISC.2025.114884MaRDI QIDQ6883637zbMATH OpenFDO

Authors Teresa W. Haynes, Michael A. Henning

Publication date 16 December 2025

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2025.114884

zbMATH Keywords

\(k\)-component dominationconnected dominationdominationtotal domination

Mathematics Subject Classification ID

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

Cites work

• 3-component domination numbers in graphs
• Bounds on the connected domination number of a graph
• Connected domination
• Connected Domination and Spanning Trees with Many Leaves
• Connected domination critical graphs with a block having maximum number of cut vertices
• Connected domination number of a graph and its complement
• Connected domination of regular graphs
• Dominating sets inducing large component in graphs with minimum degree two
• Dominating sets inducing large components
• Dominating sets inducing large components in maximal outerplanar graphs
• Domination in Graphs: Core Concepts
• Improved bounds for spanning trees with many leaves
• Matching properties in connected domination critical graphs
• On 3-component domination numbers in graphs
• On Hadwiger's Number and the Stability Number
• Proof of a conjecture on dominating sets inducing large component in graphs with minimum degree two
• Spanning trees with many leaves
• Spanning Trees with Many Leaves
• Total domination in graphs

Cited in

(1)

• Total domination versus triad domination

This page was built for publication: Connected domination versus dominating sets inducing large components

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