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: | en_US |
| Published: |
Springer Science + Business Media B.V.
2012
|
| Online Access: | http://hdl.handle.net/1721.1/70991 https://orcid.org/0000-0002-4257-4198 |