Campus Units

Mathematics

Document Type

Article

Publication Version

Submitted Manuscript

Publication Date

2016

Journal or Book Title

Journal of Combinatorial Optimization

First Page

1

Last Page

6

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).

Comments

This is a manuscript of an article from the Journal of Combinatorial Optimization (2017): 1, doi:10.1007/s10878-016-0103-z

Copyright Owner

Springer Verlag

Language

en

File Format

application/pdf

Published Version

Share

COinS