Non-geometric distance-regular graphs of diameter at least $3$ with smallest eigenvalue at least $-3$
Combinatorics
2024-12-23 v2
Abstract
In this paper, we classify non-geometric distance-regular graphs of diameter at least with smallest eigenvalue at least . This is progress towards what is hoped to be an eventual complete classification of distance-regular graphs with smallest eigenvalue at least , analogous to existing classification results available in the case that the smallest eigenvalue is at least .
Cite
@article{arxiv.2311.09001,
title = {Non-geometric distance-regular graphs of diameter at least $3$ with smallest eigenvalue at least $-3$},
author = {Jack Koolen and Kefan Yu and Xiaoye Liang and Harrison Choi and Greg Markowsky},
journal= {arXiv preprint arXiv:2311.09001},
year = {2024}
}