Tight bounds on probabilistic zero forcing on hypercubes and grids (Q2073291)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Tight bounds on probabilistic zero forcing on hypercubes and grids |
scientific article |
Statements
Tight bounds on probabilistic zero forcing on hypercubes and grids (English)
0 references
1 February 2022
0 references
Summary: 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.
0 references
0 references