Perfect matchings in paired domination vertex critical graphs

Shenwei Huang, Erfang Shan () and Liying Kang
Additional contact information
Shenwei Huang: Shanghai University
Erfang Shan: Shanghai University
Liying Kang: Shanghai University

Journal of Combinatorial Optimization, 2012, vol. 23, issue 4, No 9, 507-518

Abstract: Abstract A vertex subset S of a graph G=(V,E) is a paired dominating set if every vertex of G is adjacent to some vertex in S and the subgraph induced by S contains a perfect matching. The paired domination number of G, denoted by γ pr (G), is the minimum cardinality of a paired dominating set of G. A graph with no isolated vertex is called paired domination vertex critical, or briefly γ pr -critical, if for any vertex v of G that is not adjacent to any vertex of degree one, γ pr (G−v)

Keywords: Matching; Perfect matching; Factor-critical; Paired domination vertex critical (search for similar items in EconPapers)
Date: 2012
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-010-9368-9 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:23:y:2012:i:4:d:10.1007_s10878-010-9368-9

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

DOI: 10.1007/s10878-010-9368-9

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