Generalized power domination of graphs

DOI10.1016/j.dam.2012.03.007zbMath1244.05165OpenAlexW2014504176MaRDI QIDQ444434

Paul Dorbec, Gerard Jennhwa Chang, Mickaël Montassier, Andre 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

zbMATH Keywords

dominationpower dominationelectrical network monitoring

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

Power domination number of sunlet graph and other graphs, Resolving-power dominating sets, The k-power bondage number of a graph, k-Forcing number for Cartesian product of some graphs, An upper bound for the \(k\)-power domination number in \(r\)-uniform hypergraphs, On the \({k}\)-power domination of hypergraphs, Labeling algorithm for power domination problem of trees, Power domination in Knödel graphs and Hanoi graphs, Restricted power domination and zero forcing problems, Connected power domination in graphs, 2-power domination number for Knödel graphs and its application in communication networks, The relationship between \(k\)-forcing and \(k\)-power domination, A survey and classification of Sierpiński-type graphs, Grundy dominating sequences and zero forcing sets, Unnamed Item, Generalized power domination: propagation radius and Sierpiński graphs, Zero forcing versus domination in cubic graphs, 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, Algorithms and Complexity of Power Domination in Graphs, Power Domination in Graphs, Disproofs of three conjectures on the power domination of graphs, Power domination in regular claw-free graphs, Generalized power domination in claw-free regular graphs

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Linear algorithms on recursive representations of trees
• A note on power domination in grid graphs
• Power domination in graphs
• Power domination in block graphs
• Power Domination in Product Graphs
• Domination in Graphs Applied to Electric Power Networks
• Power domination in planar graphs with small diameter
• Fundamentals of Computation Theory
• Computing and Combinatorics
• Approximation Algorithms and Hardness for Domination with Propagation