Volume 10 (2022-2023)
Volume 9 (2021-2022)
Volume 8 (2020-2021)
Volume 7 (2019-2020)
Volume 6 (2018-2019)
Volume 5 (2017-2018)
Volume 4 (2016-2017)
Volume 3 (2015-2016)
Volume 2 (2014-2015)
Volume 1 (2013-2014)
GRAPHS WITH TOTAL FORCING NUMBER TWO, REVISITED

M. Alishahi; E. Rezaei-Sani

Volume 9, Issue 1 , September 2021, , Pages 53-60

https://doi.org/10.22044/jas.2020.9229.1451

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