Power Domination in Graphs
From MaRDI portal
Publication:3384619
DOI10.1007/978-3-030-51117-3_16zbMath1479.05261OpenAlexW3093918819MaRDI QIDQ3384619
Publication date: 15 December 2021
Published in: Topics in Domination in Graphs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-51117-3_16
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Power domination of the Cartesian product of graphs
- Generalized power domination of graphs
- On the power domination number of the generalized Petersen graphs
- Power domination on triangular grids with triangular and hexagonal shape
- Domination in graphs with bounded propagation: Algorithms, formulations and hardness results
- On the power domination number of de Bruijn and Kautz digraphs
- Note on power propagation time and lower bounds for the power domination number
- Power domination in Knödel graphs and Hanoi graphs
- The relationship between \(k\)-forcing and \(k\)-power domination
- Grundy dominating sequences and zero forcing sets
- Generalized power domination: propagation radius and Sierpiński graphs
- Power domination on permutation graphs
- Zero forcing sets and the minimum rank of graphs
- A note on power domination in grid graphs
- Power domination in graphs
- A note on power domination problem in diameter two graphs
- Generalized Power Domination in Regular Graphs
- Generalized power domination in WK-Pyramid Networks
- Heredity for generalized power domination
- Power domination in cylinders, tori, and generalized Petersen graphs
- Power Domination in Product Graphs
- Power domination in honeycomb networks
- Domination in Graphs Applied to Electric Power Networks
- Power domination in maximal planar graphs
- Power domination in generalized undirected de Bruijn graphs and Kautz graphs
- Minimum Power Dominating Sets of Random Cubic Graphs
- Power domination with bounded time constraints
This page was built for publication: Power Domination in Graphs
