On the power domination number of the generalized Petersen graphs

DOI10.1007/s10878-010-9293-yzbMath1228.90140OpenAlexW2015950545MaRDI QIDQ719033

Guangjun Xu, Li-ying Kang

Publication date: 27 September 2011

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

Full work available at URL: https://doi.org/10.1007/s10878-010-9293-y

zbMATH Keywords

generalized Petersen graphpower domination number

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items

Determining the edge metric dimension of the generalized Petersen graph \(P(n, 3)\) ⋮ Power domination in the generalized Petersen graphs ⋮ Solving the multistage PMU placement problem by integer programming and equivalent network design model ⋮ On the minimum vertex cover of generalized Petersen graphs ⋮ Power domination with bounded time constraints ⋮ \(k\)-power domination in block graphs ⋮ Power Domination in Graphs ⋮ Weakly convex and convex domination numbers for generalized Petersen and flower snark graphs ⋮ Generalized power domination in claw-free regular graphs

Cites Work

• Unnamed Item
• Parameterized power domination complexity
• The exact domination number of the generalized Petersen graphs
• On the domination number of the generalized Petersen graphs
• A note on power domination in grid graphs
• Power domination in graphs
• Power domination in block graphs
• Domination in generalized Petersen graphs
• Power Domination in Product Graphs
• Domination in Graphs Applied to Electric Power Networks
• Fundamentals of Computation Theory
• Computing and Combinatorics

This page was built for publication: On the power domination number of the generalized Petersen graphs