BENEVIDES , Fabricio

Let $\mathcal{r} ≥ 1$ be any non negative integer and let $G = (V, E)$ be any undirected graph in which a subset $D ⊆ V$ of vertices are initially infected. We consider the following process in which, at every step, each non-infected vertex with at least $\mathcal{r}$ infected neighbours becomes and an infected vertex never becomes...

Let r ≥ 1 be any non negative integer and let G = (V, E) be any undirected graph in which a subset D ⊆ V of vertices are initially infected. We consider the process in which, at every step, each non-infected vertex with at least r infected neighbours becomes infected and an infected vertex never becomes non-infected. The problem consists in...