A characterization of graphs with disjoint dominating and paired-dominating sets

DOI10.1007/s10878-009-9274-1zbMath1232.05172MaRDI QIDQ719018

Justin Southey, Michael A. Henning

Publication date: 27 September 2011

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

Full work available at URL: https://doi.org/10.1007/s10878-009-9274-1

zbMATH Keywords

domination; vertex partition; paired-domination

Mathematics Subject Classification ID

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

Related Items

A characterization of graphs with disjoint total dominating sets, A theorem of Ore and self-stabilizing algorithms for disjoint minimal dominating sets, Disjoint dominating and 2-dominating sets in graphs, Self-stabilizing algorithm for two disjoint minimal dominating sets

Cites Work

• Paired-domination in claw-free cubic graphs
• Graphs with large paired-domination number
• A characterization of cubic graphs with paired-domination number three-fifths their order
• Vertices contained in all or in no minimum paired-dominating set of a tree
• A survey of selected recent results on total domination in graphs
• Paired-domination of trees
• Paired domination on interval and circular-arc graphs
• Construction of trees and graphs with equal domination parameters
• Paired-domination in generalized claw-free graphs
• The diameter of paired-domination vertex critical graphs
• A Characterization of Graphs with Disjoint Dominating and Total Dominating Sets
• Paired-domination
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item