Spectral Graph Complexity
Not on the map. Why?
Abstract (arXiv)
We introduce a spectral notion of graph complexity derived from the Weyl's law. We experimentally demonstrate its correlation to how well the graph can be embedded in a low-dimensional Euclidean space.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 2 Nov 2022.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 1.
1 paper.