Bounds on the semipaired domination number of graphs with minimum degree at least two

DOI10.1007/S10878-020-00687-WzbMath1464.05288OpenAlexW3123442066MaRDI QIDQ2025082

Teresa W. Haynes, Michael A. Henning

Publication date: 11 May 2021

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-020-00687-w

zbMATH Keywords

dominationpaired dominationsemipaired dominationsemipaired domination number

Mathematics Subject Classification ID

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

Related Items (1)

Bounds on domination parameters in graphs: a brief survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Perfect graphs involving semitotal and semipaired domination
• Graphs with large paired-domination number
• Vertices contained in all or in no minimum semitotal dominating set of a tree
• Algorithmic aspects of semitotal domination in graphs
• Edge weighting functions on semitotal dominating sets
• Trees with unique minimum semitotal dominating sets
• Semipaired domination in maximal outerplanar graphs
• Semipaired domination in claw-free cubic graphs
• Graphs with large semipaired domination number
• On matching and semitotal domination in graphs
• Paired-domination in graphs
• Total Domination in Graphs
• Semitotal domination in claw-free cubic graphs
• Complexity and algorithms for semipaired domination in graphs

This page was built for publication: Bounds on the semipaired domination number of graphs with minimum degree at least two