摘要

Let G be a simple graph and L be its normalized Laplacian. Let lambda(n-1) be the second smallest eigenvalue of L. We first give a characterization of the graphs with lambda(n-1). Moreover, we present a lower bound on lambda(n-1), which is much better than Chung's and Grossman's bounds in some sense. Finally, we give a formal proof of Lovasz's bound on lambda(n-1).