Restricted power domination and zero forcing problems
From MaRDI portal
Publication:2424658
DOI10.1007/s10878-018-0330-6zbMath1420.05126arXiv1711.05190MaRDI QIDQ2424658
Daniela Ferrero, Boris Brimkov, Mary Flagg, Craig Erickson, Chassidy Bozeman, Leslie Hogben
Publication date: 25 June 2019
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1711.05190
05C05: Trees
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
94C15: Applications of graph theory to circuits and networks
05C57: Games on graphs (graph-theoretic aspects)
Related Items
Improved Computational Approaches and Heuristics for Zero Forcing, Uncertain Measure and its Application in Minimum Weighted Maximal Matching Problem, New computational approaches for the power dominating set problem: Set covering and the neighborhoods of zero forcing forts, Throttling for the game of cops and robbers on graphs, Power domination on triangular grids with triangular and hexagonal shape, On a conjecture for power domination, Generalized power domination in claw-free regular graphs, On the length of L-Grundy sequences, On the zero blocking number of rectangular, cylindrical, and Möbius grids, Blocking zero forcing processes in Cartesian products of graphs, On the zero forcing number of a graph involving some classical parameters, Power domination throttling, Connected power domination in graphs, The \((d-2)\)-leaky forcing number of \(Q_d\) and \(\ell\)-leaky forcing number of \(GP(n,1)\), Algorithms and Complexity of Power Domination in Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph
- A technique for computing the zero forcing number of a graph with a cut-vertex
- Propagation time for zero forcing on a graph
- Generalized power domination of graphs
- Lower bounds for positive semidefinite zero forcing and their applications
- On the \({k}\)-power domination of hypergraphs
- Improved algorithms and complexity results for power domination in graphs
- Restricted domination in graphs
- Computational approaches for zero forcing and related problems
- Note on power propagation time and lower bounds for the power domination number
- The relationship between \(k\)-forcing and \(k\)-power domination
- Restricted domination parameters in graphs
- Zero forcing sets and the minimum rank of graphs
- Power domination in graphs
- Power domination in block graphs
- Solving the Connected Dominating Set Problem and Power Dominating Set Problem by Integer Programming
- Bounds related to domination in graphs with minimum degree two
- Domination in Graphs Applied to Electric Power Networks
- The PMU Placement Problem
- Power domination with bounded time constraints
- \(k\)-power domination in block graphs
