Properties of a q-analogue for zero forcing
Published in Graphs Combin., 2020
This paper investigates a q-analogue of zero forcing. Basic properties of this game are established including determining all graphs which have minimal cost 1 or 2 for all possible q, and finding the zero forcing number for all trees when q=1.
Recommended citation: S. Butler, C. Erickson, S. Fallat, H.T. Hall, B. Kroschel, J.C.H. Lin, B. Shader, N. Warnberg, B. Yang. “Properties of a q-analogue for zero forcing.” Graphs Combin. 36 (2020), No. 5, 1401—1419.