by John on (#1039P)
When you add an edge to a graph, each of the eigenvalues of the graph Laplacian either increases or stays the same. As I wrote in my previous post, the smallest eigenvalue is always 0. The second smallest eigenvalue is 0 if and only if the graph is disconnected. So no edge will increase the […]