加载中…
We classify the distance-regular Cayley graphs with least eigenvalue and diameter at most three. Besides sporadic examples, these comprise of the lattice graphs, certain triangular graphs, and line graphs of incidence graphs of certain projective planes. In addition, we classify the possible connection sets for the lattice graphs and obtain some results on the structure of distance-regular Cayley line graphs of incidence graphs of generalized polygons.

生成讲解博客的中文版本

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