Throttling zero forcing propagation speed on graphs
From MaRDI portal
Publication:2866604
Recommendations
Cited in
(31)- An integer program for positive semidefinite zero forcing in graphs
- Propagation time for probabilistic zero forcing
- The extremal function and Colin de Verdière graph parameter
- Maximum nullity, zero forcing number and propagation time of \(\ell\)-path graphs
- The zero forcing polynomial of a graph
- On the error of \textit{a priori} sampling: zero forcing sets and propagation time
- Properties of a \(q\)-analogue of zero forcing
- Leaky forcing: a new variation of zero forcing
- Using Markov chains to determine expected propagation time for probabilistic zero forcing
- Throttling for the game of cops and robbers on graphs
- Effects of vertex degrees on the zero-forcing number and propagation time of a graph
- Fuzzification of Zero Forcing Process
- Logic circuits from zero forcing
- Skew throttling
- Propagation time for zero forcing on a graph
- The zero forcing span of a graph
- Throttling positive semidefinite zero forcing propagation time on graphs
- Computational approaches for zero forcing and related problems
- Throttling processes equivalent to full throttling on trees
- Positive semidefinite propagation time
- Zero forcing with random sets
- Connected zero forcing sets and connected propagation time of graphs
- Throttling for zero forcing and variants
- Product throttling
- Throttling for standard zero forcing on directed graphs
- Power domination throttling
- scientific article; zbMATH DE number 7731182 (Why is no real title available?)
- Various characterizations of throttling numbers
- Bounds on expected propagation time of probabilistic zero forcing
- The \(q\)-analogue of zero forcing for certain families of graphs
- Zero forcing propagation time on oriented graphs
This page was built for publication: Throttling zero forcing propagation speed on graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2866604)
