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

DOI10.1007/s10878-009-9266-1zbMath1319.05101OpenAlexW2057939750MaRDI QIDQ491215

Yuansheng Yang, Xirong Xu, Kai Lü, Haoli Wang

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

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

Mathematics Subject Classification ID

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

Related Items (3)

Power domination in the generalized Petersen graphs ⋮ The bondage number of generalized Petersen graphs \(P(n,2)\) ⋮ 2-distance paired-dominating number of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Paired-domination of trees
• Paired domination on interval and circular-arc graphs
• Distance paired domination numbers of graphs
• Paired-domination in generalized claw-free graphs
• Paired-domination in graphs

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