Article
Note on Power Propagation Time and Lower Bounds for the Power Domination Number
Journal of Combinatorial Optimization
Document Type
Article
Disciplines
Publication Version
Accepted Manuscript
Publication Date
10-1-2017
DOI
10.1007/s10878-016-0103-z
Abstract
We present a counterexample to a lower bound for the power domination number given in Liao (J Comb Optim 31:725–742, 2016). 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. (Discrete Appl Math 160:1994–2005, 2012).
Copyright Owner
Springer Science Business Media New York
Copyright Date
2016
Language
en
File Format
application/pdf
Citation Information
Daniela Ferrero, Leslie Hogben, Franklin H. J. Kenter and Michael Young. "Note on Power Propagation Time and Lower Bounds for the Power Domination Number" Journal of Combinatorial Optimization Vol. 34 Iss. 3 (2017) p. 736 - 741 Available at: http://works.bepress.com/leslie-hogben/26/
This is a post-peer-review, pre-copyedit version of an article published in Journal of Combinatorial Optimization. The final authenticated version is available online at DOI: 10.1007/s10878-016-0103-z. Posted with permission.