1. Dorit Aharonov, Andris Ambainis, Julia Kempe, Umesh Vazirani, Quantum walks on graphs, in: STOC ’01: Proceedings of the Thirty-third Annual ACM Symposium on Theory of Computing (New York, NY, USA), ACM, 2001, pp. 50–59.
2. A counterexample to the rank-coloring conjecture;Alon;J. Graph Theory,1989
3. The Wreath Product of Graphs, Graphs and Applications (Boulder, Colo., 1982);Anderson,1985
4. Zero forcing parameters and minimum rank problems;Barioli;Linear Algebra Appl.,2010
5. Jonathan E. Beagley, Sivaram K. Narayan, Eileen L. Radzwion, Sara P. Rimer, Rachael L. Tomasino, Jennifer L. Wolfe, Andrew M. Zimmer, The minimum semidefinite rank of a graph using vertex sums, graphs with msr(G)=|G|-2, and the msrs of certain graph classes, in: NSF-REU Report from Central Michigan University (Summer 2007).