On the power domination number of the generalized Petersen graphs
From MaRDI portal
Publication:719033
DOI10.1007/S10878-010-9293-YzbMATH Open1228.90140OpenAlexW2015950545MaRDI QIDQ719033FDOQ719033
Authors: Guangjun Xu, Liying 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
Recommendations
Cites Work
- Domination in Graphs Applied to Electric Power Networks
- Power domination in graphs
- Parameterized power domination complexity
- A note on power domination in grid graphs
- Power Domination in Product Graphs
- The exact domination number of the generalized Petersen graphs
- On the domination number of the generalized Petersen graphs
- Power domination in block graphs
- Fundamentals of Computation Theory
- Computing and Combinatorics
- Title not available (Why is that?)
- Domination in generalized Petersen graphs
Cited In (30)
- A note on power domination problem in diameter two graphs
- Power domination in Mycielskian of spiders
- Generalized power domination: propagation radius and Sierpiński graphs
- Power domination in cylinders, tori, and generalized Petersen graphs
- Generalized power domination in regular graphs
- Generalized power domination in claw-free regular graphs
- Failed power domination on graphs
- Weakly convex and convex domination numbers for generalized Petersen and flower snark graphs
- Power domination in the generalized Petersen graphs
- Power domination number of sunlet graph and other graphs
- Power Domination in Product Graphs
- Determining the edge metric dimension of the generalized Petersen graph \(P(n, 3)\)
- On the independent domination number of the generalized Petersen graphs
- Power domination in maximal planar graphs
- The exact domination number of the generalized Petersen graphs
- Power domination in certain chemical structures
- On the minimum vertex cover of generalized Petersen graphs
- 2-power domination number for Knödel graphs and its application in communication networks
- On a conjecture for power domination
- Failed power domination in grids, cylinders, and tori
- Power domination in Mycielskians of n -spiders
- \(k\)-power domination in block graphs
- On the domination number of the generalized Petersen graphs
- Power domination in graphs
- Power domination in certain nanotori
- Power domination on triangular grids with triangular and hexagonal shape
- Power domination with bounded time constraints
- Title not available (Why is that?)
- Power domination on permutation graphs
- Solving the multistage PMU placement problem by integer programming and equivalent network design model
This page was built for publication: On the power domination number of the generalized Petersen graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q719033)