Graph curvature via resistance distance
Let G=(V,E) be a finite, combinatorial graph. We define a notion of curvature on the vertex set V via the inverse of the resistance distance matrix. We prove that this notion of curvature has a number of desirable properties. Graphs with curvature bounded from below by K>0 have diameter bound...
| Main Authors: | , , |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
Elsevier
2024
|