Let G be a tree on n vertices and let L = D - A denote the Laplacian matrix on G . The second-smallest eigenvalue λ 2 ( G ) > 0 , also known as the algebraic connectivity, as well as the associated eigenvector have been of substantial interest. We inve... ...
