Campus Units

Mathematics

Document Type

Article

Publication Version

Submitted Manuscript

Publication Date

10-2017

Journal or Book Title

Journal of Combinatorial Optimization

Volume

34

Issue

3

First Page

736

Last Page

741

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 34, no. 3 (2017): 736-741. doi:10.1007/s10878-016-0103-z. Posted with permission.

Copyright Owner

Springer Science+Business Media New York

Language

en

File Format

application/pdf

Published Version

Share

COinS