Restricted power domination and zero forcing problems
Published in J. Comb. Optim., 2019
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.
Recommended citation: C. Bozeman, B. Brimkov, C. Erickson, D. Ferrero, M. Flagg, L. Hogben. “Restricted power domination and zero forcing problems.” J. Comb. Optim. 37 (2019), No. 3, 935—956.