Tight Bounds on Probabilistic Zero Forcing on Hypercubes and Grids
-
Published:2022-01-28
Issue:1
Volume:29
Page:
-
ISSN:1077-8926
-
Container-title:The Electronic Journal of Combinatorics
-
language:
-
Short-container-title:Electron. J. Combin.
Author:
Behague Natalie C.,Marbach Trent G.,Prałat Paweł
Abstract
Zero forcing is a deterministic iterative graph colouring process in which vertices are coloured either blue or white, and in every round, any blue vertices that have a single white neighbour force these white vertices to become blue. Here we study probabilistic zero forcing, where blue vertices have a non-zero probability of forcing each white neighbour to become blue. We explore the propagation time for probabilistic zero forcing on hypercubes and grids.
Publisher
The Electronic Journal of Combinatorics
Subject
Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science,Applied Mathematics,Discrete Mathematics and Combinatorics