Disproofs of three conjectures on the power domination of graphs
From MaRDI portal
Publication:2057589
Recommendations
Cites work
- A note on power domination in grid graphs
- Approximation Algorithms and Hardness for Domination with Propagation
- Computing and Combinatorics
- Domination in Graphs Applied to Electric Power Networks
- Domination in graphs with bounded propagation: Algorithms, formulations and hardness results
- Fundamentals of Computation Theory
- Generalized power domination in regular graphs
- Generalized power domination of graphs
- Graph theory
- Improved algorithms and complexity results for power domination in graphs
- Power Domination in Product Graphs
- Power domination in block graphs
- Power domination in graphs
- Power domination in regular claw-free graphs
- The relationship between \(k\)-forcing and \(k\)-power domination
- Zero forcing sets and the minimum rank of graphs
- \(k\)-power domination in block graphs
Cited in
(4)
This page was built for publication: Disproofs of three conjectures on the power domination of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2057589)