Propagation time for probabilistic zero forcing

zbMath1493.05286arXiv1812.10476MaRDI QIDQ5090539

Leslie Hogben, Jesse T. Geneson

Publication date: 20 July 2022

Full work available at URL: https://arxiv.org/abs/1812.10476

zbMATH Keywords

discrete dynamical systempropagation time

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (1)

Zero forcing with random sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast-mixed searching and related problems on graphs
• Propagation time for zero forcing on a graph
• Upper bounds on the \(k\)-forcing number of a graph
• Throttling for the game of cops and robbers on graphs
• On the runtime and robustness of randomized broadcasting
• Positive semidefinite propagation time
• Zero forcing parameters and minimum rank problems
• Domination in graphs with bounded propagation: Algorithms, formulations and hardness results
• The shortest-path problem for graphs with random arc-lengths
• A lower bound on the zero forcing number
• Bounds on expected propagation time of probabilistic zero forcing
• Probabilistic zero forcing on random graphs
• Zero forcing sets and the minimum rank of graphs
• Iteration Index of a Zero Forcing Set in a Graph
• Using Markov chains to determine expected propagation time for probabilistic zero forcing
• The Zero Forcing Number of Graphs
• Probabilistic Zero Forcing in Graphs
• Inverse Problems and Zero Forcing for Graphs
• Bounds for the Zero Forcing Number of Graphs with Large Girth
• Randomized Rumour Spreading: The Effect of the Network Topology

This page was built for publication: Propagation time for probabilistic zero forcing