Geodesic
Tight bounds on probabilistic zero forcing on hypercubes and grids
The electronic journal of combinatorics, Tome 29 (2022) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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.
DOI : 10.37236/10585
Classification : 05D40, 05C15
Mots-clés : probabilistic zero forcing, propagation time

Natalie C. Behague  1   ; Trent G. Marbach  1   ; Paweł Prałat  1

1 Ryerson University 
@article{10_37236_10585,
     author = {Natalie C. Behague and Trent G. Marbach and Pawe{\l} Pra{\l}at},
     title = {Tight bounds on probabilistic zero forcing on hypercubes and grids},
     journal = {The electronic journal of combinatorics},
     year = {2022},
     volume = {29},
     number = {1},
     doi = {10.37236/10585},
     zbl = {1514.05176},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/10585/}
}
TY  - JOUR
AU  - Natalie C. Behague
AU  - Trent G. Marbach
AU  - Paweł Prałat
TI  - Tight bounds on probabilistic zero forcing on hypercubes and grids
JO  - The electronic journal of combinatorics
PY  - 2022
VL  - 29
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/10585/
DO  - 10.37236/10585
ID  - 10_37236_10585
ER  - 
%0 Journal Article
%A Natalie C. Behague
%A Trent G. Marbach
%A Paweł Prałat
%T Tight bounds on probabilistic zero forcing on hypercubes and grids
%J The electronic journal of combinatorics
%D 2022
%V 29
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/10585/
%R 10.37236/10585
%F 10_37236_10585
Natalie C. Behague; Trent G. Marbach; Paweł Prałat. Tight bounds on probabilistic zero forcing on hypercubes and grids. The electronic journal of combinatorics, Tome 29 (2022) no. 1. doi: 10.37236/10585

Cité par Sources :