The algebraic connectivity of a graph is the numerically second smallest eigenvalue (counting multiple eigenvalues separately) of the Laplacian
matrix of a graph . In other words, it is the second smallest root of the graph's
Laplacian polynomial. This eigenvalue is
greater than 0 iff is a connected graph.