On Cheeger‐type inequalities for weighted graphs

We give several bounds on the second smallest eigenvalue of the weighted Laplacian matrix of a finite graph and on the second largest eigenvalue of its weighted adjacency matrix. We establish relations between the given Cheeger-type bounds here and the known bounds in the literature. We show that one of our bounds is the best Cheeger-type bound available. 2002 Wiley Periodicals, Inc. J Graph Theory 41: 1–17, 2002