Nordhaus-Gaddum problems for power domination
From MaRDI portal
Publication:1627850
DOI10.1016/j.dam.2018.06.004zbMath1401.05210arXiv1610.03115OpenAlexW2810011178WikidataQ129602778 ScholiaQ129602778MaRDI QIDQ1627850
Daniela Ferrero, Veronika Furst, Leslie Hogben, Katherine F. Benson, Violeta Vasilevska, Mary Flagg
Publication date: 3 December 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1610.03115
Related Items (3)
On a conjecture for power domination ⋮ Some product graphs with power dominating number at most 2 ⋮ Generalized power domination in claw-free regular graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved algorithms and complexity results for power domination in graphs
- A survey of Nordhaus-Gaddum type relations
- Positive semidefinite zero forcing
- Zero forcing sets and the minimum rank of graphs
- A note on power domination in grid graphs
- Power domination in graphs
- Generalized Power Domination in Regular Graphs
- On Complementary Graphs
- Power Domination in Product Graphs
- Vertex domination-critical graphs
- Domination in planar graphs with small diameter*
- Domination in Graphs Applied to Electric Power Networks
- On the domination number of a random graph
This page was built for publication: Nordhaus-Gaddum problems for power domination
