Graphs with large semipaired domination number

DOI10.7151/dmgt.2143zbMath1411.05204OpenAlexW2884228923WikidataQ129521095 ScholiaQ129521095MaRDI QIDQ2416951

Michael A. Henning, Teresa W. Haynes

Publication date: 27 May 2019

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2143

zbMATH Keywords

paired-dominationsemipaired domination

Mathematics Subject Classification ID

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

Related Items (7)

Semipaired Domination in Some Subclasses of Chordal Graphs ⋮ Bounds on domination parameters in graphs: a brief survey ⋮ Bounds on the semipaired domination number of graphs with minimum degree at least two ⋮ A characterization of trees based on edge-deletion and its applications for domination-type invariants ⋮ Complexity and algorithms for semipaired domination in graphs ⋮ Semipaired domination in maximal outerplanar graphs ⋮ Unique minimum semipaired dominating sets in trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graphs with large paired-domination number
• Vertices contained in all or in no minimum semitotal dominating set of a tree
• Edge weighting functions on semitotal dominating sets
• On matching and semitotal domination in graphs
• A note on the upper bound for the paired-domination number of a graph with minimum degree at least two
• Paired-domination in graphs
• Total Domination in Graphs
• Semitotal domination in claw-free cubic graphs

This page was built for publication: Graphs with large semipaired domination number