Spectral Graph Complexity
classification
💻 cs.SI
keywords
graphcomplexityspectralcorrelationdemonstratederivedembeddedeuclidean
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.