Tight bounds on the algebraic connectivity of a balanced binary tree

Most read articles by the same author(s)

• Brydon Eastman, Bryan L Shader, Kevin N. Vander Meulen, Sparse spectrally arbitrary patterns , The Electronic Journal of Linear Algebra: Vol. 28 (2015)
• Elizabeth Doering, T. S. Michael, Bryan L. Shader, Even and odd tournament matrices with minimum rank over finite fields , The Electronic Journal of Linear Algebra: Vol. 22 (2011)
• Mao-Ting Chien, Michael Neumann, Positive definiteness of tridiagonal matrices via the numerical range , The Electronic Journal of Linear Algebra: Vol. 3 (1998)
• Gwang-Yeon Lee, Bryan L. Shader, Sign-consistency and solvability of constrained linear systems , The Electronic Journal of Linear Algebra: Vol. 4 (1998)
• Bryan Shader, Note from Editor-in-chief , The Electronic Journal of Linear Algebra: Vol. 26 (2013)
• Bryan L. Shader, From the Editor-in-Chief , The Electronic Journal of Linear Algebra: Vol. 21 (2010)
• Michael Neumann, Jianhong Xu, A note on Newton and Newton-like inequalities for M-matrices and for Drazin inverses of M-Matrices , The Electronic Journal of Linear Algebra: Vol. 15 (2006)
• Jason J. Molitierno, Michael Neumann, The algebraic connectivity of two trees connected by an edge of infinite weight , The Electronic Journal of Linear Algebra: Vol. 8 (2001)
• Michael Neumann, Jianhong Xu, A parallel algorithm for computing the group inverse via Perron complementation , The Electronic Journal of Linear Algebra: Vol. 13 (2005)
• Michael Neumann, Nic Ormes, Bounds for graph expansions via elasticity , The Electronic Journal of Linear Algebra: Vol. 10 (2003)