2000 character limit reached
Power propagation time and lower bounds for power domination number
Published 20 Dec 2015 in math.CO | (1512.06413v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.