Probabilistic Zero Forcing on Grid, Regular, and Hypercube Graphs

zbMath1502.05237arXiv2010.12343MaRDI QIDQ5045054

No author found.

Publication date: 3 November 2022

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

zbMATH Keywords

regular graphhypercube graphgrid graphzero forcingpropagation timeprobabilistic zero forcing

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Games on graphs (graph-theoretic aspects) (05C57)