Article ID Journal Published Year Pages File Type
9513132 Discrete Mathematics 2005 4 Pages PDF
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.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
An eigenvalue bound for the Laplacian of a graph
Authors
,