Throttling for standard zero forcing on directed graphs
From MaRDI portal
Publication:5869432
zbMath1497.05069arXiv2008.08646MaRDI QIDQ5869432
Joshua Carlson, Ashley Zhuang, Peter Hollander, Emily Lopez, Emily Cairncross, Benjamin Kitchen
Publication date: 28 September 2022
Full work available at URL: https://arxiv.org/abs/2008.08646
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Propagation time for zero forcing on a graph
- Zero forcing propagation time on oriented graphs
- Throttling positive semidefinite zero forcing propagation time on graphs
- On the error of \textit{a priori} sampling: zero forcing sets and propagation time
- Power domination throttling
- Path cover number, maximum nullity, and zero forcing number of oriented graphs and other simple digraphs
- Extremal \(k\)-forcing sets in oriented graphs
- Zero forcing sets and the minimum rank of graphs
- Various characterizations of throttling numbers
- Graph Theory
- Throttling for Zero Forcing and Variants
This page was built for publication: Throttling for standard zero forcing on directed graphs