The maximum nullity of a complete subdivision graph is equal to its zero forcing number

Most read articles by the same author(s)

• Shaun M. Fallat, Charles R. Johnson, Ronald L. Smith, The general totally positive matrix completion problem with few unspecified entries , The Electronic Journal of Linear Algebra: Vol. 7 (2000)
• Leslie Hogben, Ulrica Wilson, Eventual properties of matrices , The Electronic Journal of Linear Algebra: Vol. 23 (2012)
• Leslie Hogben, A note on minimum rank and maximum nullity of sign patterns , The Electronic Journal of Linear Algebra: Vol. 22 (2011)
• Nathan L. Chenette, Sean V. Droms, Leslie Hogben, Rana Mikkelson, Olga Pryporova, Minimum rank of a graph over an arbitrary field , The Electronic Journal of Linear Algebra: Vol. 16 (2007)
• Shaun M. Fallat, Pauline van den Driessche, On matrices with all minors negative , The Electronic Journal of Linear Algebra: Vol. 7 (2000)
• Steve Butler, Interlacing for weighted graphs using the normalized Laplacian , The Electronic Journal of Linear Algebra: Vol. 16 (2007)
• Shaun M. Fallat, Lon H. Mitchell, Colin de Verdière parameters of chordal graphs , The Electronic Journal of Linear Algebra: Vol. 26 (2013)
• Francesco Barioli, Shaun M. Fallat, Lon H. Mitchell, Sivaram K. Narayan, Minimum semidefinite rank of outerplanar graphs and the tree cover number , The Electronic Journal of Linear Algebra: Vol. 22 (2011)
• Wayne Barrett, Hein van der Holst, Raphael Loewy, Graphs whose minimal rank is two: The finite fields case , The Electronic Journal of Linear Algebra: Vol. 14 (2005)
• Travis Peters, John Goldwasser, Michael Young, LIGHTS OUT! on Cartesian Products , The Electronic Journal of Linear Algebra: Vol. 32 (2017)