2000 character limit reached
Non-geometric distance-regular graphs of diameter at least $3$ with smallest eigenvalue at least $-3$
Published 15 Nov 2023 in math.CO | (2311.09001v2)
Abstract: 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$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.