pith. sign in

arxiv: 1512.06019 · v2 · pith:MY7N7MV3new · submitted 2015-12-18 · 🧮 math.CO

Distance-regular Cayley graphs with least eigenvalue -2

classification 🧮 math.CO
keywords graphscayleydistance-regularcertainclassifyeigenvalueincidencelattice
0
0 comments X
read the original abstract

We classify the distance-regular Cayley graphs with least eigenvalue $-2$ 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.