Metric uniformization and spectral bounds for graphs
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 the geometry of the graph. In many interesting cases, the existence of such a metric is shown by examining the combinatoric...
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Springer Science + Business Media B.V.,
2012-06-01T18:25:24Z.
|
| Subjects: | |
| Online Access: | Get fulltext |