The algebraic connectivity of two trees connected by an edge of infinite weight

Most read articles by the same author(s)

• Mao-Ting Chien, Michael Neumann, Positive definiteness of tridiagonal matrices via the numerical range , The Electronic Journal of Linear Algebra: Vol. 3 (1998)
• Jason J. Molitierno, Michael Neumann, Bryan L. Shader, Tight bounds on the algebraic connectivity of a balanced binary tree , The Electronic Journal of Linear Algebra: Vol. 6 (1999)
• 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)
• 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)
• Assaf Goldberger, Michael Neumann, On a strong form of a conjecture of Boyle and Handelman , The Electronic Journal of Linear Algebra: Vol. 9 (2002)