Restricted power domination and zero forcing problems

@article{Bozeman2019RestrictedPD,
  title={Restricted power domination and zero forcing problems},
  author={Chassidy Bozeman and Boris Brimkov and Craig Erickson and Daniela Ferrero and Mary Flagg and Leslie Hogben},
  journal={Journal of Combinatorial Optimization},
  year={2019},
  volume={37},
  pages={935-956}
}
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… 
Connected power domination in graphs
TLDR
It is shown that the connected power domination number of a graph is NP-hard to compute in general, but can be computed in linear time in cactus graphs and block graphs.
Power domination polynomials of graphs
A power dominating set of a graph is a set of vertices that observes every vertex in the graph by combining classical domination with an iterative propagation process arising from electrical circuit
New computational approaches for the power dominating set problem: Set covering and the neighborhoods of zero forcing forts
TLDR
A method for computing minimum power dominating sets via a set cover IP formulation and a novel constraint generation procedure and several computation enhancements which be be applied to the methodology as well as existing methods are proposed.
C O ] 2 8 M ay 2 01 8 Power domination polynomials of graphs
A power dominating set of a graph is a set of vertices that observes every vertex in the graph by combining classical domination with an iterative propagation process arising from electrical circuit
Power domination throttling
Power domination on triangular grids with triangular and hexagonal shape
TLDR
The power domination number of a graph G is the minimum size of a set S such that this process ends up with the set M containing every vertex of G .
Power Domination Number On Shackle Operation with Points as Lingkage
TLDR
The purpose of this study is to determine the Shackle operations graph value from several special graphs with a point as a link with the smallest cardinality of a power dominating set with the notation power domination number.
The zero forcing polynomial of a graph
On a Conjecture for Power Domination
TLDR
The minimum cardinality of a power dominating set of a graph G is the power domination number of G, denoted by G, and it is shown that if G is a graph on n vertices such that every component of G and its complement $${\overline{G}}$$ have at least three vertices, then G is connected.
Generalized Power Domination in Claw-Free Regular Graphs
In this paper, we give a series of counterexamples to negate a conjecture and answer an open question on the k -power domination of regular graphs [see Dorbec et al. (SIAM J Discrete Math
...
...

References

SHOWING 1-10 OF 26 REFERENCES
Power domination in block graphs
Power domination in graphs
Domination in Graphs Applied to Electric Power Networks
TLDR
It is shown that the power dominating set (PDS) problem is NP-complete even when restricted to bipartite graphs or chordal graphs and a linear algorithm is given to solve the PDS for trees.
Improved Algorithms and Complexity Results for Power Domination in Graphs
TLDR
Improved reductions imply that Power Dominating Set parameterized by |P| is W[2]-hard and it cannot be better approximated than Dominate Set, and several NP-completeness results are simplified and extended.
Zero forcing and power domination for graph products
The power domination number arises from the monitoring of electrical networks and its determination is an important problem. Upper bounds for power domination numbers can be obtained by
On the Power Dominating Sets of Hypercubes
TLDR
The power domination number of a graph is the minimum cardinality of a power dominating set of the graph for hypercubes Qn with n = 2 k , where k is any positive integer.
Restricted domination in graphs
$$k$$k-Power domination in block graphs
TLDR
This paper presents a linear-time algorithm for k-power domination in block graphs, a common generalization of domination and power domination, and presents a solution to the power system monitoring problem.
Propagation time for zero forcing on a graph
...
...