Department of Mathematics and Statistics, University of Dalhousie, Halifax, Canada B3H 3J5
Abstract:
We present a lower bound for the smallest non-zero eigenvalue of the Laplacian of an undirected graph. The bound is primarily useful for graphs with small diameter.