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

DOI10.1007/S10878-009-9266-1MaRDI QIDQ491215zbMATH OpenOpenAlexFDO

Authors Haoli Wang, Xirong Xu, Yuansheng Yang, Kai Lu

Publication date 24 August 2015

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-009-9266-1

zbMATH Keywords

\(k\)-distance paired domination numbergeneralized Petersen graphpaired domination number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• scientific article; zbMATH DE number 6837042
• On the \([1,2]\)-domination number of generalized Petersen graphs
• Distance paired domination numbers of graphs
• On the distance paired-domination of circulant graphs
• 2-distance paired-dominating number of graphs

Cites work

• Distance paired domination numbers of graphs
• scientific article; zbMATH DE number 1185309 (Why is no real title available?)
• scientific article; zbMATH DE number 1743834 (Why is no real title available?)
• scientific article; zbMATH DE number 2108130 (Why is no real title available?)
• Paired domination on interval and circular-arc graphs
• Paired-domination in generalized claw-free graphs
• Paired-domination in graphs
• Paired-domination of trees

Cited in

(6)

• Power domination in the generalized Petersen graphs
• The bondage number of generalized Petersen graphs \(P(n,2)\)
• Distance paired domination numbers of graphs
• scientific article; zbMATH DE number 6837042 (Why is no real title available?)
• 2-distance paired-dominating number of graphs
• On the distance paired-domination of circulant graphs

This page was built for publication: On the distance paired domination of generalized Petersen graphs \(P(n,1)\) and \(P(n,2)\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q491215)