Zero forcing and power domination for graph products
From MaRDI portal
Publication:5374237
Recommendations
Cites work
- A note on power domination in grid graphs
- A protocol for cooling and controlling composite systems by local interactions
- Domination in Graphs Applied to Electric Power Networks
- Fast-mixed searching and related problems on graphs
- Minimum rank of skew-symmetric matrices described by a graph
- Note on power propagation time and lower bounds for the power domination number
- On minimum rank and zero forcing sets of a graph
- Power Domination in Product Graphs
- Power domination in certain chemical structures
- Power domination in cylinders, tori, and generalized Petersen graphs
- Power domination with bounded time constraints
- The Construction of Jacobi and Periodic Jacobi Matrices With Prescribed Spectra
- The PMU Placement Problem
- The inverse eigenvalue problem for Hermitian matrices whose graphs are cycles
- The minimum rank of symmetric matrices described by a graph: a survey
- Universally optimal matrices and field independence of the minimum rank of a graph
- Zero forcing sets and the minimum rank of graphs
Cited in
(40)- Zero forcing and maximum nullity for hypergraphs
- Infectious power domination of hypergraphs
- Propagation time for probabilistic zero forcing
- Zero forcing in iterated line digraphs
- On the zero forcing number and propagation time of oriented graphs
- On the zero forcing number of a graph involving some classical parameters
- Recent results on the power domination numbers of graph products
- Connected power domination in graphs
- Grundy domination and zero forcing in regular graphs
- Failed power domination on graphs
- The relationship between \(k\)-forcing and \(k\)-power domination
- Algorithms and complexity of power domination in graphs
- Using Markov chains to determine expected propagation time for probabilistic zero forcing
- Nordhaus-Gaddum problems for power domination
- On the power domination number of the Cartesian product of graphs
- Bounds on zero forcing using (upper) total domination and minimum degree
- The liberation set in the inverse eigenvalue problem of a graph
- On Grundy total domination number in product graphs
- Constructions of cospectral graphs with different zero forcing numbers
- Minimum rank and zero forcing number for butterfly networks
- 2-power domination number for Knödel graphs and its application in communication networks
- On a conjecture for power domination
- Computational approaches for zero forcing and related problems
- The zero forcing number of claw-free cubic graphs
- Complexity and computation of connected zero forcing
- On the length of L-Grundy sequences
- Note on forcing problem of trees
- Maximum nullity and zero forcing of circulant graphs
- Note on power propagation time and lower bounds for the power domination number
- Restricted power domination and zero forcing problems
- Power domination in graphs
- Power domination on triangular grids with triangular and hexagonal shape
- Zero forcing in triangulations
- The \((d-2)\)-leaky forcing number of \(Q_d\) and \(\ell\)-leaky forcing number of \(GP(n,1)\)
- Zero forcing in benzenoid network
- Power domination throttling
- scientific article; zbMATH DE number 7493307 (Why is no real title available?)
- Bounds on expected propagation time of probabilistic zero forcing
- Rigid linkages and partial zero forcing
- Reconfiguration graphs of zero forcing sets
This page was built for publication: Zero forcing and power domination for graph products
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5374237)
