The Smallest Eigenvalues of a Graph Laplacian

There is a well-known theorem that quickly computes the smallest eigenvalue if the graph is bipartite, but I'm not aware of any generalization (which may be quite useful for some results in econometrics).