Nondiscriminatory propagation on trees
From MaRDI portal
Publication:3548664
DOI10.1088/1751-8113/41/48/482002zbMath1156.81357arXiv0805.0181OpenAlexW3123397167MaRDI QIDQ3548664
Publication date: 16 December 2008
Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0805.0181
Related Items
Throttling for Zero Forcing and Variants ⋮ Failed skew zero forcing on a graph ⋮ Throttling processes equivalent to full throttling on trees ⋮ Positive semidefinite propagation time ⋮ Some bounds on the zero forcing number of a graph ⋮ Minimum rank and zero forcing number for butterfly networks ⋮ A technique for computing the zero forcing number of a graph with a cut-vertex ⋮ Failed zero forcing and critical sets on directed graphs ⋮ Unnamed Item ⋮ Infection in hypergraphs ⋮ Propagation time for zero forcing on a graph ⋮ Throttling positive semidefinite zero forcing propagation time on graphs ⋮ Positive Zero Forcing and Edge Clique Coverings ⋮ Bounds on expected propagation time of probabilistic zero forcing ⋮ On leaky forcing and resilience ⋮ Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph ⋮ On the nullity of a connected graph in terms of order and maximum degree ⋮ On the error of \textit{a priori} sampling: zero forcing sets and propagation time ⋮ Logic circuits from zero forcing ⋮ On the relationships between zero forcing numbers and certain graph coverings ⋮ Approximating the minimum rank of a graph via alternating projection ⋮ A short proof for a lower bound on the zero forcing number ⋮ On the complexity of the positive semidefinite zero forcing number ⋮ On the zero forcing number of a graph involving some classical parameters ⋮ Skew throttling ⋮ On the Adjacency-Jacobsthal numbers ⋮ Positive semidefinite zero forcing numbers of two classes of graphs ⋮ On zero forcing number of graphs and their complements
