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 γ k p (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.
Similar content being viewed by others
References
Bresar B, Henning MA, Rall DF (2008) Paired-domination of Cartesian products of graphs. Util Math 24:303–308
Cheng TCE, Kang LY, Ng CT (2007) Paired domination on interval and circular-arc graphs. Discrete Appl Math 155:2077–2086
Dorbec P, Gravier S (2007) Paired-domination in P 5-free graphs. Graphs Combin 73:255–265
Dorbec P, Gravier S, Henning MA (2007) Paired-domination in generalized claw-free graphs. J Comb Optim 14:1–7
Haynes TW, Hedetniemi ST, Slater PJ (1998) Fundamentals of domination in graphs. Marcel Dekker, New York
Haynes TW, Slater PJ (1995) Paired-domination and the paired-domatic number. Congr Numer 109:65–72
Haynes TW, Slater PJ (1998) Paired-domination in graphs. Networks 32:199–206
Proffitt KE, Haynes TW, Slater PJ (2001) Paired-domination in grid graphs. Congr Numer 150:161–172
Qiao H, Kang LY, Cardei M, Du DZ (2003) Paired-domination of trees. J Global Optim 25:43–54
Raczek J (2008) Distance paired domination numbers of graphs. Discrete Math 308:2473–2483
Shan E, Kang L, Henning MA (2004) A characterization of trees with equal total domination and paired-domination numbers. Australas J Combin 30:31–39
Author information
Authors and Affiliations
Corresponding author
Additional information
The research is supported by Chinese Natural Science Foundations (60573022), Specialized Research Fund for the Doctoral Program of Higher Education (200801411073) and Research Foundation of DLUT.
Rights and permissions
About this article
Cite this article
Wang, H., Xu, X., Yang, Y. et al. On the distance paired domination of generalized Petersen graphs P(n,1) and P(n,2). J Comb Optim 21, 481–496 (2011). https://doi.org/10.1007/s10878-009-9266-1
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-009-9266-1