1. AIM Minimum Rank—Special Graphs Work Group, Barioli F, Barrett W, Butle 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 (2008) Zero forcing sets and the minimum rank of graphs. Linear Algebra Appl 428(7):1628–1648
2. Baldwin TL, Mili L, Boisen MB, Adapa R (1993) Power system observability with minimal phasor measurement placement. IEEE Trans Power Syst 8(2):707–715
3. Benson KF, Ferrero D, Flagg M, Furst V, Hogben L, Vasilevska V, Wissman B (2017) Zero forcing and power domination for graph products. Australas J Comb 70(2):221–235
4. Bienstock D (1991) Graph searching, path-width, tree-width and related problems (a survey). In: Roberts FS, Hwang FK, Monma CL (eds) Reliability of computer and communication network. DIMACS series in discrete mathematics and theoretical computer science, vol 5. American Mathematical Society, Providence, pp 33–49
5. Bienstock D, Seymour P (1991) Monotonicity in graph searching. J Algorithms 12(2):239–245