Restricted power domination and zero forcing problems
- 148 Downloads
Power domination in graphs arises from the problem of monitoring an electric power system by placing as few measurement devices in the system as possible. A power dominating set of a graph is a set of vertices that observes every vertex in the graph, following a set of rules for power system monitoring. A practical problem of interest is to determine the minimum number of additional measurement devices needed to monitor a power network when the network is expanded and the existing devices remain in place. In this paper, we study the problem of finding the smallest power dominating set that contains a given set of vertices X. We also study the related problem of finding the smallest zero forcing set that contains a given set of vertices X. The sizes of such sets in a graph G are respectively called the restricted power domination number and restricted zero forcing number of G subject to X. We derive several tight bounds on the restricted power domination and zero forcing numbers of graphs, and relate them to other graph parameters. We also present exact and algorithmic results for computing the restricted power domination number, including integer programs for general graphs and a linear time algorithm for graphs with bounded treewidth. We also use restricted power domination to obtain a parallel algorithm for finding minimum power dominating sets in trees.
KeywordsPower domination Restricted power domination Zero forcing Restricted zero forcing
Mathematics Subject Classification05C69 05C50 05C57 94C15
This research began at the American Institute of Mathematics workshop Zero forcing and its applications with support from National Science Foundation, DMS-1128242. The work of BB is supported in part by the National Science Foundation, Grant No. 1450681. We thank AIM and NSF for their support. We also thank the referees for their careful reading and helpful comments, which have improved the paper.
- Barioli F, Barrett W, Butler S, Cioabă 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, Van der Meulen K, Wangsness A, AIM Minimum Rank—Special Graphs Work Group (2008) Zero forcing sets and the minimum rank of graphs. Linear Algebra Appl 428:1628–1648MathSciNetCrossRefzbMATHGoogle Scholar
- Brimkov B, Fast CC, Hicks IV (2017) Graphs with extremal connected forcing numbers http://arxiv.org/abs/1701.08500
- Brimkov B, Fast CC, Hicks IV (2018) Computational approaches for zero forcing and related problems. https://arxiv.org/abs/1704.02065
- Butler S, DeLoss L, Grout J, Hall HT, LaGrange J, Lin JC-H, McKay T, Smith J, Tims G Minimum Rank Library (Sage programs for calculating bounds on the minimum rank of a graph, and for computing zero forcing parameters). https://sage.math.iastate.edu/home/pub/84/
- Dean N, Ilic A, Ramirez I, Shen J, Tian K (2011) On the power dominating sets of hypercubes. In: IEEE 14th international conference on computational science and engineering (CSE), pp 488–491Google Scholar
- Fan N, Watson JP (2012) Solving the connected dominating set problem and power dominating set problem by integer programming. In: International conference on combinatorial optimization and applications, pp 371–383Google Scholar
- Ferrero D, Hogben L, Kenter FHJ, Young M (2017) Note on power propagation time and lower bounds for the power domination number. J Comb Optim 34(3):736–741Google Scholar
- Ferrero D, Hogben L, Kenter FHJ, Young M (2018) The relationship between \(k\)-forcing and \(k\)-power domination. Discrete Math. 341(6):1789–1797Google Scholar