Median eigenvalues of subcubic graphs
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910913839235072 |
|---|---|
| author | Acharya, Hricha Jeter, Benjamin Jiang, Zilin |
| author_facet | Acharya, Hricha Jeter, Benjamin Jiang, Zilin |
| contents | We show that the median eigenvalues of every connected graph of maximum degree at most three, except for the Heawood graph, are at most $1$ in absolute value, resolving open problems posed by Fowler and Pisanski, and by Mohar. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_13139 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Median eigenvalues of subcubic graphs Acharya, Hricha Jeter, Benjamin Jiang, Zilin Combinatorics 05C50, 15A18 We show that the median eigenvalues of every connected graph of maximum degree at most three, except for the Heawood graph, are at most $1$ in absolute value, resolving open problems posed by Fowler and Pisanski, and by Mohar. |
| title | Median eigenvalues of subcubic graphs |
| topic | Combinatorics 05C50, 15A18 |
| url | https://arxiv.org/abs/2502.13139 |