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

Justin Southey and Michael A. Henning ()
Additional contact information
Justin Southey: University of KwaZulu-Natal
Michael A. Henning: University of KwaZulu-Natal

Journal of Combinatorial Optimization, 2011, vol. 22, issue 2, No 7, 217-234

Abstract: Abstract A dominating set of a graph is a set of vertices such that every vertex not in the set is adjacent to a vertex in the set, while a paired-dominating set of a graph is a set of vertices such that every vertex is adjacent to a vertex in the set and the subgraph induced by the set contains a perfect matching. In this paper, we provide a constructive characterization of graphs whose vertex set can be partitioned into a dominating set and a paired-dominating set.

Keywords: Domination; Paired-domination; Vertex partition (search for similar items in EconPapers)
Date: 2011
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-009-9274-1 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:22:y:2011:i:2:d:10.1007_s10878-009-9274-1

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-009-9274-1

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().