Distance-regular Cayley graphs with least eigenvalue $-2$
Combinatorics
2016-04-28 v2
Abstract
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.
Keywords
Cite
@article{arxiv.1512.06019,
title = {Distance-regular Cayley graphs with least eigenvalue $-2$},
author = {Alireza Abdollahi and Edwin van Dam and Mojtaba Jazaeri},
journal= {arXiv preprint arXiv:1512.06019},
year = {2016}
}
Comments
13 pages, On line paper as open access to publish in Des. Codes Cryptogr