Note on power propagation time and lower bounds for the power domination number

Daniela Ferrero (), Leslie Hogben (), Franklin H. J. Kenter () and Michael Young ()
Additional contact information
Daniela Ferrero: Texas State University
Leslie Hogben: Iowa State University
Franklin H. J. Kenter: Rice University
Michael Young: Iowa State University

Journal of Combinatorial Optimization, 2017, vol. 34, issue 3, No 6, 736-741

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

Keywords: Power domination; Power propagation time; Propagation time; Time constraint; 05C69; 05C12; 05C15; 05C57; 94C15 (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-016-0103-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:34:y:2017:i:3:d:10.1007_s10878-016-0103-z

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-016-0103-z

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().