Generalized power domination of graphs
From MaRDI portal
Publication:444434
DOI10.1016/J.DAM.2012.03.007zbMATH Open1244.05165OpenAlexW2014504176MaRDI QIDQ444434FDOQ444434
Authors: Gerard Jennhwa Chang, Paul Dorbec, Mickaël Montassier, André Raspaud 
Publication date: 14 August 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2012.03.007
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Domination in Graphs Applied to Electric Power Networks
- Power domination in graphs
- Approximation Algorithms and Hardness for Domination with Propagation
- Parameterized power domination complexity
- 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 planar graphs with small diameter
- Linear algorithms on recursive representations of trees
- Power domination in block graphs
- Fundamentals of Computation Theory
- Computing and Combinatorics
Cited In (41)
- A note on power domination in grid graphs
- Power Domination in $\mathcal{O}^*(1.7548^n)$ Using Reference Search Trees
- Power domination in generalized undirected de Bruijn graphs and Kautz graphs
- \(k\)-forcing number for Cartesian product of some graphs
- On the power domination number of graph products
- Generalized Powers of Graphs and Their Algorithmic Use
- Power domination in Knödel graphs and Hanoi graphs
- Generalized power domination: propagation radius and Sierpiński graphs
- A survey and classification of Sierpiński-type graphs
- Power domination in cylinders, tori, and generalized Petersen graphs
- Connected power domination in graphs
- Generalized power domination in regular graphs
- Generalized power domination in claw-free regular graphs
- Power domination number of sunlet graph and other graphs
- The relationship between \(k\)-forcing and \(k\)-power domination
- Domination in Graphs Applied to Electric Power Networks
- Algorithms and complexity of power domination in graphs
- Resolving-power dominating sets
- Zero forcing versus domination in cubic graphs
- The \(k\)-power bondage number of a graph
- 2-power domination number for Knödel graphs and its application in communication networks
- Generalized perfect domination in graphs
- Title not available (Why is that?)
- On the \({k}\)-power domination of hypergraphs
- Improved algorithms and complexity results for power domination in graphs
- The \(k\)-power domination problem in weighted trees
- The \(k\)-power domination problem in weighted trees
- An upper bound for the \(k\)-power domination number in \(r\)-uniform hypergraphs
- Hardness results of connected power domination for bipartite graphs and chordal graphs
- Power domination in regular claw-free graphs
- \(k\)-power domination in block graphs
- Restricted power domination and zero forcing problems
- Power domination in graphs
- Labeling algorithm for power domination problem of trees
- Power domination with bounded time constraints
- Grundy dominating sequences and zero forcing sets
- Title not available (Why is that?)
- Disproofs of three conjectures on the power domination of graphs
- Power domination throttling
- Fundamentals of Computation Theory
- Power domination in graphs
This page was built for publication: Generalized power domination of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q444434)
