The $k$-conversion number of regular graphs

C. M. Mynhardt, J. L. Wodlinger

Given a graph $G=(V,E)$ and a set $S_0\subseteq V$, an irreversible $k$-threshold conversion process on $G$ is an iterative process wherein, for each $t=1,2,\dots$, $S_t$ is obtain…