1. Ashkan Aazami, Hardness results and approximation algorithms for some problems on graphs, PhD Thesis, University of Waterloo, Waterloo, Ontario, Canada, (2008).
2. Zero forcing sets and the minimum rank of graphs
3. Noga Alon, A propagation process on Cayley graphs, Schools of Mathematics and Computer Science, Raymond and Beverly Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv, 69978, Israel and IAS, Princeton, NJ 08540, USA.
4. Zero forcing parameters and minimum rank problems
5. Zero Forcing, Linear and Quantum Controllability for Systems Evolving on Networks