Disproofs of three conjectures on the power domination of graphs
From MaRDI portal
Publication:2057589
DOI10.1016/J.DAM.2021.10.006zbMATH Open1479.05288OpenAlexW3211100225WikidataQ122951674 ScholiaQ122951674MaRDI QIDQ2057589FDOQ2057589
Authors: Baoyindureng Wu, Wei Yang
Publication date: 7 December 2021
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2021.10.006
Recommendations
Cites Work
- Graph theory
- Zero forcing sets and the minimum rank of graphs
- Generalized power domination of graphs
- Domination in Graphs Applied to Electric Power Networks
- Power domination in graphs
- Approximation Algorithms and Hardness for Domination with Propagation
- Improved algorithms and complexity results for power domination in graphs
- Domination in graphs with bounded propagation: Algorithms, formulations and hardness results
- A note on power domination in grid graphs
- Power Domination in Product Graphs
- Power domination in block graphs
- Fundamentals of Computation Theory
- Computing and Combinatorics
- Generalized power domination in regular graphs
- \(k\)-power domination in block graphs
- Power domination in regular claw-free graphs
- The relationship between \(k\)-forcing and \(k\)-power domination
Cited In (3)
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)