Probabilistic Zero Forcing in Graphs

zbMath1274.05475arXiv1204.6237MaRDI QIDQ4925703

Eunjeong Yi, Cong X. Kang

Publication date: 12 June 2013

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

zbMATH Keywords

Markov processzero forcingabsorbing chainsprobalistic color change ruleprobalistic zero forcing

Mathematics Subject Classification ID

Trees (05C05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items

Zero forcing with random sets, Infection in hypergraphs, Probabilistic zero forcing on random graphs, Bounds on expected propagation time of probabilistic zero forcing, Propagation time for probabilistic zero forcing, Effects of vertex degrees on the zero-forcing number and propagation time of a graph, Tight bounds on probabilistic zero forcing on hypercubes and grids, Using Markov chains to determine expected propagation time for probabilistic zero forcing