Connected zero forcing sets and connected propagation time of graphs

• DOI: 10.22108/toc.2020.115286.1617
• Publication Date: 2020-06-01
• Authors: Maryam Khosravi; Saeedeh Rashidi; Alemeh Sheikhhoss...
• Keywords: Zero (linguistics); Forcing (mathematics)

The zero forcing number $Z(G)$ of a graph $G$ is the minimum cardinality set $S$ with colored (black) vertices which forces $V(G)$ to be after some times. ``color change rule'': white vertex changed black when it only neighbor vertex. In this case, we say that We investigate here concept connected and number. discusses subject for special graphs products graphs. Also introduce propagation time. Graphs extreme times maximum $|G|-1$ $|G|-2$ are characterized.