We derive bounds for eigenvalues of the Laplacian of graphs using the discrete versions of the Sobolev inequalities and heat kernel estimates.
Chung and Yau REF , derive bounds on the eigenvalues of the Laplacians using the Sobolev inequalities and heat kernel estimates.
Eigenvalues of graphs and Sobolev inequalities
Combin. Probab. Comput
Computer Science Mathematics