Restricted power domination and zero forcing problems

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.

[1]  Daniela Ferrero,et al.  The relationship between k-forcing and k-power domination , 2018, Discret. Math..

[2]  Min Zhao,et al.  Power domination in block graphs , 2006, Theor. Comput. Sci..

[3]  Darren D. Row.  A technique for computing the zero forcing number of a graph with a cut-vertex , 2012 .

[4]  André Raspaud,et al.  Generalized power domination of graphs , 2012, Discret. Appl. Math..

[5]  Chung-Shou Liao.  Power domination with bounded time constraints , 2016, J. Comb. Optim..

[6]  Boting Yang.  Lower bounds for positive semidefinite zero forcing and their applications , 2017, J. Comb. Optim..

[7]  Boris Brimkov,et al.  Graphs with Extremal Connected Forcing Numbers , 2017, ArXiv.

[8]  Sarah Meyer,et al.  Propagation time for zero forcing on a graph , 2012, Discret. Appl. Math..

[9]  Neng Fan,et al.  Solving the Connected Dominating Set Problem and Power Dominating Set Problem by Integer Programming , 2012, COCOA.

[10]  Lenwood S. Heath,et al.  The PMU Placement Problem , 2005, SIAM J. Discret. Math..

[11]  Wayne Goddard,et al.  Restricted domination parameters in graphs , 2007, J. Comb. Optim..

[12]  Rolf Niedermeier,et al.  Improved Algorithms and Complexity Results for Power Domination in Graphs , 2005, Algorithmica.

[13]  Jian Shen,et al.  On the Power Dominating Sets of Hypercubes , 2011, 2011 14th IEEE International Conference on Computational Science and Engineering.

[14]  Michael A. Henning.  Restricted domination in graphs , 2002, Discret. Math..

[15]  Laura A. Sanchis.  Bounds related to domination in graphs with minimum degree two , 1997 .

[16]  Michael A. Henning,et al.  Domination in Graphs Applied to Electric Power Networks , 2002, SIAM J. Discret. Math..

[17]  Boris Brimkov,et al.  Computational Approaches for Zero Forcing and Related Problems , 2019, Eur. J. Oper. Res..

[18]  Daniela Ferrero,et al.  Note on power propagation time and lower bounds for the power domination number , 2017, J. Comb. Optim..

[19]  Chao Wang,et al.  $$k$$k-Power domination in block graphs , 2016, J. Comb. Optim..

[20]  Gerard J. Chang,et al.  On the k\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varvec{k}$$\end{document}-power domination of hypergraphs , 2013, Journal of Combinatorial Optimization.

[21]  Vittorio Giovannetti,et al.  Full control by locally induced relaxation. , 2007, Physical review letters.

[22]  Min Zhao,et al.  Power domination in graphs , 2006, Discret. Math..

[23]  Leslie Hogben,et al.  Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph , 2012 .

[24]  W. Haemers.  Zero forcing sets and minimum rank of graphs , 2008 .