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

被引：0
作者：
Haoli Wang
Xirong Xu
Yuansheng Yang
Kai Lü
机构：
[1] Dalian University of Technology,Department of Computer Science
来源：
Journal of Combinatorial Optimization | 2011年 / 21卷
关键词：
Paired domination number; -distance paired domination number; Generalized Petersen graph;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
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 γpk(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.
引用
收藏
页码：481 / 496
页数：15
相关论文
共 26 条
  • [1] Bresar B(2008)Paired-domination of Cartesian products of graphs Util Math 24 303-308
  • [2] Henning MA(2007)Paired domination on interval and circular-arc graphs Discrete Appl Math 155 2077-2086
  • [3] Rall DF(2007)Paired-domination in Graphs Combin 73 255-265
  • [4] Cheng TCE(2007)-free graphs J Comb Optim 14 1-7
  • [5] Kang LY(1995)Paired-domination in generalized claw-free graphs Congr Numer 109 65-72
  • [6] Ng CT(1998)Paired-domination and the paired-domatic number Networks 32 199-206
  • [7] Dorbec P(2001)Paired-domination in graphs Congr Numer 150 161-172
  • [8] Gravier S(2003)Paired-domination in grid graphs J Global Optim 25 43-54
  • [9] Dorbec P(2008)Paired-domination of trees Discrete Math 308 2473-2483
  • [10] Gravier S(2004)Distance paired domination numbers of graphs Australas J Combin 30 31-39
123