Recursive Spectral Bisection
LG is negative semidefinite
Its largest eigenvalue is zero and the corresponding eigenvector is all ones.
The magnitude of the second largest eigenvalue gives a measure of the connectivity of the graph.
Its corresponding eigenvector gives a measure of distances between nodes.