pith. sign in

arxiv: 1512.06413 · v2 · pith:7VJWV5J6new · submitted 2015-12-20 · 🧮 math.CO

Power propagation time and lower bounds for power domination number

classification 🧮 math.CO
keywords powerpropagationtimedominationforcingliaolowernumber
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.