On the distance paired domination of generalized Petersen graphs P(n,1) and P(n,2)

Haoli Wang, Xirong Xu, Yuansheng Yang () and Kai Lü
Additional contact information
Haoli Wang: Dalian University of Technology
Xirong Xu: Dalian University of Technology
Yuansheng Yang: Dalian University of Technology
Kai Lü: Dalian University of Technology

Journal of Combinatorial Optimization, 2011, vol. 21, issue 4, No 6, 496 pages

Abstract: Abstract Let G=(V,E) be a graph without an isolated vertex. A set D⊆V(G) is a k -distance paired dominating set of G if D is a k-distance dominating set of G and the induced subgraph 〈D〉 has a perfect matching. The minimum cardinality of a k-distance paired dominating set for graph G is the k -distance paired domination number, denoted by γ p k (G). In this paper, we determine the exact k-distance paired domination number of generalized Petersen graphs P(n,1) and P(n,2) for all k≥1.

Keywords: Paired domination number; k-distance paired domination number; Generalized Petersen graph (search for similar items in EconPapers)
Date: 2011
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-009-9266-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:21:y:2011:i:4:d:10.1007_s10878-009-9266-1

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

DOI: 10.1007/s10878-009-9266-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 ().