17 search results - page 4 / 4 » On the geometry of graphs with a forbidden minor |
FOCS
2009
IEEE
13 years 11 months ago
2009
IEEE
— We present a general method for proving upper bounds on the eigenvalues of the graph Laplacian. In particular, we show that for any positive integer k, the kth smallest eigenva...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
We present a method for proving upper bounds on the eigenvalues of the graph Laplacian. A main step involves choosing an appropriate "Riemannian" metric to uniformize th...