Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash 91 tok/s
Gemini 2.5 Pro 46 tok/s Pro
GPT-5 Medium 33 tok/s
GPT-5 High 27 tok/s Pro
GPT-4o 102 tok/s
GPT OSS 120B 465 tok/s Pro
Kimi K2 205 tok/s Pro
2000 character limit reached

Power propagation time and lower bounds for power domination number (1512.06413v2)

Published 20 Dec 2015 in math.CO

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.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.