Power propagation time and lower bounds for power domination number

2015/12/20 by Daniela Ferrero, Ferrero, Daniela, Leslie Hogben +5 · 1 citation
Computer Science · Economics, Econometrics and Finance · #05C12 #05C15 #05C57 #05C69 #94C15 #Advanced Graph Theory Research #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #FOS: Mathematics #Game Theory and Voting Systems

paper · pdf · doi:10.48550/arxiv.1512.06413

openalex publication_date 2015/12/20 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We present a counterexample to a lower bound for the power domination number given in Liao, Power domination with bounded time constraints, J. Comb. Optim. 31 (2016)725-742. We also define the power propagation time, using the power domination propagation ideas in Liao and the (zero forcing) propagation time in Hogben et al, Propagation time for zero forcing on a graph, Discrete Appl. Math.160 (2012) 1994-2005.

Cited by

• The Power Contamination Problem on Grids Revisited: Optimality, Combinatorics, and Links to Integer Sequences
• Power domination and zero forcing

Related

• On the power propagation time of a graph
• Power domination and zero forcing
• Restricted power domination and zero forcing problems
• The relationship between k-forcing and k-power domination
• Bounds on the propagation radius in power domination