Publication:6119465
From MaRDI portal
Unnamed Author, Unnamed Author, Franklin H. J. Kenter
Publication date: 22 March 2024
Full work available at URL: http://ajc.maths.uq.edu.au/pdf/88/ajc_v88_p308.pdf
Games involving graphs (91A43) Structural characterization of families of graphs (05C75) Games on graphs (graph-theoretic aspects) (05C57)
Cites Work
- Unnamed Item
- Restricted power domination and fault-tolerant power domination on grids
- Zero forcing parameters and minimum rank problems
- Computational approaches for zero forcing and related problems
- Effects of vertex degrees on the zero-forcing number and propagation time of a graph
- On the error of \textit{a priori} sampling: zero forcing sets and propagation time
- On leaky forcing and resilience
- Zero forcing sets and the minimum rank of graphs
- Power domination in graphs
- The \((d-2)\)-leaky forcing number of \(Q_d\) and \(\ell\)-leaky forcing number of \(GP(n,1)\)
- Zero Forcing Sets and Controllability of Dynamical Systems Defined on Graphs
- The Zero Forcing Number of Graphs
- Domination in Graphs Applied to Electric Power Networks
- Zero Forcing, Linear and Quantum Controllability for Systems Evolving on Networks
- The PMU Placement Problem