Zero forcing propagation time on oriented graphs
From MaRDI portal
Publication:526815
DOI10.1016/j.dam.2017.02.017zbMath1361.05041OpenAlexW2600955787MaRDI QIDQ526815
Publication date: 15 May 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://lib.dr.iastate.edu/math_pubs/56
Related Items (11)
On the zero forcing number and propagation time of oriented graphs ⋮ Computational approaches for zero forcing and related problems ⋮ Throttling for standard zero forcing on directed graphs ⋮ Extremal \(k\)-forcing sets in oriented graphs ⋮ On the zero blocking number of rectangular, cylindrical, and Möbius grids ⋮ An integer program for positive semidefinite zero forcing in graphs ⋮ Failed zero forcing and critical sets on directed graphs ⋮ Blocking zero forcing processes in Cartesian products of graphs ⋮ The zero forcing polynomial of a graph ⋮ On the zero forcing number of a graph involving some classical parameters ⋮ Power domination throttling
Cites Work
- Fractional zero forcing via three-color forcing games
- Proof of a conjecture on the zero forcing number of a graph
- Extremal values and bounds for the zero forcing number
- Propagation time for zero forcing on a graph
- Upper bounds on the \(k\)-forcing number of a graph
- Zero forcing number, constrained matchings and strong structural controllability
- Minimum rank problems
- Path cover number, maximum nullity, and zero forcing number of oriented graphs and other simple digraphs
- Zero forcing sets and the minimum rank of graphs
- Iteration Index of a Zero Forcing Set in a Graph
- On the minimum rank of not necessarily symmetric matrices: A preliminary study
- Zero Forcing, Linear and Quantum Controllability for Systems Evolving on Networks
- Minimum rank, maximum nullity, and zero forcing number of simple digraphs
- Unnamed Item
- Unnamed Item
This page was built for publication: Zero forcing propagation time on oriented graphs
