Connected zero forcing sets and connected propagation time of graphs

M. Khosravi, S. Rashidi 2, A. Sheikhhosseni

The zero forcing number $Z(G)$ of a graph $G$ is the minimum cardinality of a set $S$ with colored (black) vertices which forces the set $V(G)$ to be colored (black) after some tim…