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

Most read articles by the same author(s)

• Michael S. Cavers, Shaun M. Fallat, Allow problems concerning spectral properties of patterns , The Electronic Journal of Linear Algebra: Vol. 23 (2012)
• 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, Michael J. Tsatsomeros, On the Cayley transform of positivity classes of matrices , The Electronic Journal of Linear Algebra: Vol. 9 (2002)
• Luz Maria DeAlba, Timothy L. Hardy, Leslie Hogben, Amy Wangsness, The (weakly) sign symmetric P-matrix completion problems , The Electronic Journal of Linear Algebra: Vol. 10 (2003)
• Wayne Barrett, Anne Lazenby, Nicole Malloy, Curtis Nelson, William Sexton, Ryan Smith, John Sinckovic, Tianyi Yang, The combinatorial inverse eigenvalue problems: complete graphs and small graphs with strict inequality , The Electronic Journal of Linear Algebra: Vol. 26 (2013)
• Shaun M. Fallat, Pauline van den Driessche, On matrices with all minors negative , The Electronic Journal of Linear Algebra: Vol. 7 (2000)
• Minerva Catral, Dale D. Olesky, Pauline van den Driessche, Block representations of the Drazin inverse of a bipartite matrix , The Electronic Journal of Linear Algebra: Vol. 18 (2009)
• Steve Butler, Using twins and scaling to construct cospectral graphs for the normalized Laplacian , The Electronic Journal of Linear Algebra: Vol. 28 (2015)
• Wayne Barrett, Nicole Malloy, Curtis Nelson, William Sexton, John Sinkovic, Diagonal entry restrictions in minimum rank matrices , The Electronic Journal of Linear Algebra: Vol. 26 (2013)
• Leslie Hogben, A note on minimum rank and maximum nullity of sign patterns , The Electronic Journal of Linear Algebra: Vol. 22 (2011)