Properties of a \(q\)-analogue of zero forcing
From MaRDI portal
Publication:2227980
DOI10.1007/s00373-020-02208-2zbMath1458.05166arXiv1809.07640OpenAlexW3043654613MaRDI QIDQ2227980
Boting Yang, Craig Erickson, Steve Butler, Jephian C.-H. Lin, Nathan Warnberg, H. Tracy Hall, Shaun M. Fallat, Bryan L. Shader, Brenda K. Kroschel
Publication date: 16 February 2021
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1809.07640
Trees (05C05) Games involving graphs (91A43) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial games (91A46) Games on graphs (graph-theoretic aspects) (05C57)
Related Items
Cites Work
- Fast-mixed searching and related problems on graphs
- A technique for computing the zero forcing number of a graph with a cut-vertex
- Propagation time for zero forcing on a graph
- Zero forcing parameters and minimum rank problems
- Positive semidefinite zero forcing
- Zero forcing sets and the minimum rank of graphs
- Using variants of zero forcing to bound the inertia set of a graph