Graphs with disjoint dominating and paired-dominating sets

DOI10.2478/S11533-010-0033-4zbMath1215.05126OpenAlexW1975999209MaRDI QIDQ607427

Justin Southey, Michael A. Henning

Publication date: 22 November 2010

Published in: Central European Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2478/s11533-010-0033-4

zbMATH Keywords

cubic graphdominationvertex partitionpaired-domination

Mathematics Subject Classification ID

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

Related Items (1)

Minimal graphs with disjoint dominating and paired-dominating sets

Cites Work

• Paired-domination in claw-free cubic graphs
• Graphs with large paired-domination number
• 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 in \(P_{5}\)-free graphs
• Paired-domination of trees
• Paired domination on interval and circular-arc graphs
• 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
• Paired-domination in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Graphs with disjoint dominating and paired-dominating sets