Vertices in all minimum paired-dominating sets of block graphs

Lei Chen, Changhong Lu () and Zhenbing Zeng
Additional contact information
Lei Chen: Shanghai Maritime University
Changhong Lu: East China Normal University
Zhenbing Zeng: East China Normal University

Journal of Combinatorial Optimization, 2012, vol. 24, issue 3, No 3, 176-191

Abstract: Abstract Let G=(V,E) be a simple graph without isolated vertices. A set S⊆V is a paired-dominating set if every vertex in V−S has at least one neighbor in S and the subgraph induced by S contains a perfect matching. In this paper, we present a linear-time algorithm to determine whether a given vertex in a block graph is contained in all its minimum paired-dominating sets.

Keywords: Domination; Paired-domination; Algorithm; Block graph; Tree (search for similar items in EconPapers)
Date: 2012
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-011-9375-5 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:24:y:2012:i:3:d:10.1007_s10878-011-9375-5

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

DOI: 10.1007/s10878-011-9375-5

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 ().