Skip to main content
Log in

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

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

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

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1

Similar content being viewed by others

References

  • Aazami A (2010) Domination in graphs with bounded propagation: algorithms, formulations and hardness results. J Comb Optim 19:429–456

    Article  MathSciNet  MATH  Google Scholar 

  • Aazami A (2008) Hardness results and approximation algorithms for some problems on graphs. PhD Thesis, University of Waterloo. http://hdl.handle.net/10012/4147

  • AIM Minimum Rank – Special Graphs Work Group, Barioli F, Barrett W, Butler S, Cioaba SM, Cvetković D, Fallat SM, Godsil C, Haemers W, Hogben L, Mikkelson R, Narayan S, Pryporova O, Sciriha I, So W, Stevanović D, van der Holst H, Vander Meulen K, Wehe AW (2008) Zero forcing sets and the minimum rank of graphs. Linear Algebra Appl 428:1628–1648

  • Baldwin TL, Mili L, Boisen MB Jr, Adapa R (1993) Power system observability with minimal phasor measurement placement. IEEE Trans Power Syst 8:707–715

    Article  Google Scholar 

  • Benson KF, Ferrero D, Flagg M, Furst V, Hogben L, Vasilevska V, Wissman B Power domination and zero forcing. Under review. arxiv:1510.02421

  • Brueni DJ, Heath LS (2005) The PMU placement problem. SIAM J Discrete Math 19:744–761

    Article  MathSciNet  MATH  Google Scholar 

  • Burgarth D, Giovannetti V (2007) Full control by locally induced relaxation. Phys Rev Lett PRL 99:100501

    Article  Google Scholar 

  • Guo J, Niedermeier R, Raible D (2008) Improved algorithms and complexity results for power domination in graphs. Algorithmica 52:177–202

    Article  MathSciNet  MATH  Google Scholar 

  • Haynes TW, Hedetniemi SM, Hedetniemi ST, Henning MA (2002) Domination in graphs applied to electric power networks. SIAM J Discrete Math 15:519–529

    Article  MathSciNet  MATH  Google Scholar 

  • Hogben L, Huynh M, Kingsley N, Meyer S, Walker S, Young M (2012) Propagation time for zero forcing on a graph. Discrete Appl Math 160:1994–2005

    Article  MathSciNet  MATH  Google Scholar 

  • Liao C-S (2016) Power domination with bounded time constraints. J Comb Optim 31:725–742

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Leslie Hogben.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ferrero, D., Hogben, L., Kenter, F.H.J. et al. Note on power propagation time and lower bounds for the power domination number. J Comb Optim 34, 736–741 (2017). https://doi.org/10.1007/s10878-016-0103-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-016-0103-z

Keywords

Mathematics Subject Classification

Navigation