A note on power domination in grid graphs
From MaRDI portal
Publication:2492204
DOI10.1016/j.dam.2005.08.006zbMath1090.05054OpenAlexW1995497993MaRDI QIDQ2492204
Michael A. Henning, Michael J. Dorfling
Publication date: 9 June 2006
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2005.08.006
Related Items (45)
Power domination number of sunlet graph and other graphs ⋮ Nordhaus-Gaddum problems for power domination ⋮ The k-power bondage number of a graph ⋮ Power domination of the Cartesian product of graphs ⋮ Observing the State of a Smart Grid Using Bilevel Programming ⋮ Power domination in cubic graphs and Cartesian products ⋮ On the power domination number of the Cartesian product of graphs ⋮ Power domination in Mycielskian of spiders ⋮ Power domination on permutation graphs ⋮ New computational approaches for the power dominating set problem: Set covering and the neighborhoods of zero forcing forts ⋮ Binary programming formulations for the upper domination problem ⋮ Labeling algorithm for power domination problem of trees ⋮ Power domination in Knödel graphs and Hanoi graphs ⋮ Power domination in circular-arc graphs ⋮ 2-power domination number for Knödel graphs and its application in communication networks ⋮ Failed power domination in grids, cylinders, and tori ⋮ Unnamed Item ⋮ Generalized power domination of graphs ⋮ Complexity and lowers bounds for power edge set problem ⋮ Power domination in certain chemical structures ⋮ Complexity and inapproximability results for the power edge set problem ⋮ Power domination in honeycomb networks ⋮ Improved algorithms and complexity results for power domination in graphs ⋮ Generalized power domination: propagation radius and Sierpiński graphs ⋮ Restricted power domination and fault-tolerant power domination on grids ⋮ Domination in graphs with bounded propagation: Algorithms, formulations and hardness results ⋮ On the power domination number of the generalized Petersen graphs ⋮ Algorithms and applications for a class of bilevel MILPs ⋮ On the Power Domination Number of Graph Products ⋮ Power domination with bounded time constraints ⋮ \(k\)-power domination in block graphs ⋮ The \(k\)-power domination problem in weighted trees ⋮ On a conjecture for power domination ⋮ Unnamed Item ⋮ Algorithms and Complexity of Power Domination in Graphs ⋮ Power Domination in Graphs ⋮ Disproofs of three conjectures on the power domination of graphs ⋮ Unnamed Item ⋮ Power domination in regular claw-free graphs ⋮ Power domination in cylinders, tori, and generalized Petersen graphs ⋮ Power domination on triangular grids with triangular and hexagonal shape ⋮ Power domination throttling ⋮ Some product graphs with power dominating number at most 2 ⋮ On \((t,r)\) broadcast domination numbers of grids ⋮ Generalized power domination in claw-free regular graphs
Cites Work
This page was built for publication: A note on power domination in grid graphs
