1. Barioli F, Barrett W, Butler S, Cioabă SM, Cvetković D, Fallat SM, Godsil C, Haemers W, Hogben L, Mikkelson R, Narayan S, Pryporova O, Sciriha I, So W, Stevanović D, van der Holst H, Van der Meulen K, Wangsness A, AIM Minimum Rank—Special Graphs Work Group (2008) Zero forcing sets and the minimum rank of graphs. Linear Algebra Appl 428:1628–1648
2. Benson KF, Ferrero D, Flagg M, Furst V, Hogben L, Vasilevska V, Wissman B (2018) Zero forcing and power domination for graph products. Australas J Combin 70:221–235
3. Brimkov B, Fast CC, Hicks IV (2017) Graphs with extremal connected forcing numbers
http://arxiv.org/abs/1701.08500
4. Brimkov B, Fast CC, Hicks IV (2018) Computational approaches for zero forcing and related problems.
https://arxiv.org/abs/1704.02065
5. Brueni DJ, Heath LS (2005) The PMU placement problem. SIAM J Discrete Math 19:744–761