The sets of eigenvalues of weighted graph Laplacians are fully described for every valid four-vertex graph coming from a pair-of-pants decomposition of a genus-3 surface.
Linear programming bounds for hyperbolic surfaces
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.SP 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Flexibility of eigenvalues for graph Laplacians arising from genus 3 surfaces
The sets of eigenvalues of weighted graph Laplacians are fully described for every valid four-vertex graph coming from a pair-of-pants decomposition of a genus-3 surface.