Non-geometric distance-regular graphs of diameter at least $3$ with smallest eigenvalue at least $-3$
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2023
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866915071803785216 |
|---|---|
| author | Koolen, Jack Yu, Kefan Liang, Xiaoye Choi, Harrison Markowsky, Greg |
| author_facet | Koolen, Jack Yu, Kefan Liang, Xiaoye Choi, Harrison Markowsky, Greg |
| contents | In this paper, we classify non-geometric distance-regular graphs of diameter at least $3$ with smallest eigenvalue at least $-3$. This is progress towards what is hoped to be an eventual complete classification of distance-regular graphs with smallest eigenvalue at least $-3$, analogous to existing classification results available in the case that the smallest eigenvalue is at least $-2$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2311_09001 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Non-geometric distance-regular graphs of diameter at least $3$ with smallest eigenvalue at least $-3$ Koolen, Jack Yu, Kefan Liang, Xiaoye Choi, Harrison Markowsky, Greg Combinatorics 05C50 In this paper, we classify non-geometric distance-regular graphs of diameter at least $3$ with smallest eigenvalue at least $-3$. This is progress towards what is hoped to be an eventual complete classification of distance-regular graphs with smallest eigenvalue at least $-3$, analogous to existing classification results available in the case that the smallest eigenvalue is at least $-2$. |
| title | Non-geometric distance-regular graphs of diameter at least $3$ with smallest eigenvalue at least $-3$ |
| topic | Combinatorics 05C50 |
| url | https://arxiv.org/abs/2311.09001 |