1 citations · 1 across the 3 of their papers we have counts for
3 papers
math.CO2024
Bootstrap percolation and -hull number in direct products of graphs
Boštjan Brešar, Jaka Hedžet, Rebekah Herrman
The -neighbor bootstrap percolation is a graph infection process based on the update rule by which a vertex with infected neighbors becomes infected. We say that an initial…
math.CO2023
Spreading in graphs
Boštjan Brešar, Tanja Dravec, Aysel Erey +1
Several concepts that model processes of spreading (of information, disease, objects, etc.) in graphs or networks have been studied. In many contexts, we assume that some vertices…
math.CO2023★ 1 cited
-Neighbor bootstrap percolation on grids
Jaka Hedžet, Michael A. Henning
Given a graph and assuming that some vertices of are infected, the -neighbor bootstrap percolation rule makes an uninfected vertex infected if has at least i…