加载中…
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 .

生成讲解博客的中文版本

生成AI智能校验的中文版本