##### GRAPHS WITH TOTAL FORCING NUMBER TWO, REVISITED

M. Alishahi; E. Rezaei-Sani

Volume 9, Issue 1 , September 2021, , Pages 53-60
##### Abstract
A subset of the vertex set of a graph $G$ is called a zero forcing set if by considering them colored and, as far as possible, a colored vertex with exactly one non-colored neighbor forces its non-colored neighbor to get colored, then the whole vertices of $G$ become colored. The total forcing number ...  Read More