3-component domination numbers in graphs

DOI10.1016/j.disc.2023.113859OpenAlexW4390291923MaRDI QIDQ6117350

Zhipeng Gao, Changqing Xi, Rongling Lang, Jun Yue

Publication date: 19 February 2024

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

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

zbMATH Keywords

domination3-component domination

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Total domination in maximal outerplanar graphs. II.
• On graphs having domination number half their order
• Dominating sets in planar graphs
• The annihilation number does not bound the 2-domination number from the above
• On the \([1,2\)-domination number of generalized Petersen graphs]
• Dominating sets inducing large components
• 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
• Integer linear programming formulations for double roman domination problem