Power domination on triangular grids with triangular and hexagonal shape
From MaRDI portal
Publication:782760
DOI10.1007/s10878-020-00587-zzbMath1447.90047arXiv1707.02760OpenAlexW2807719019MaRDI QIDQ782760
Claire Pennarun, Valentin Gledel, Sander Verdonschot, Prosenjit Bose
Publication date: 29 July 2020
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1707.02760
Related Items (1)
Cites Work
- Unnamed Item
- Power domination of the Cartesian product of graphs
- Improved algorithms and complexity results for power domination in graphs
- Domination in graphs with bounded propagation: Algorithms, formulations and hardness results
- Generalized power domination: propagation radius and Sierpiński graphs
- Restricted power domination and zero forcing problems
- Connected power domination in graphs
- A note on power domination in grid graphs
- Power domination in graphs
- Power domination in block graphs
- Heredity for generalized power domination
- Power domination in cylinders, tori, and generalized Petersen graphs
- The Domination Number of Grids
- Power Domination in Product Graphs
- Power domination in honeycomb networks
- Domination in Graphs Applied to Electric Power Networks
- Computing and Combinatorics
- Power domination with bounded time constraints
This page was built for publication: Power domination on triangular grids with triangular and hexagonal shape
