Background
Type:

Distance-regular Cayley graphs with least eigenvalue - 2

Journal: Designs, Codes, and Cryptography (09251022)Year: 1 July 2017Volume: 84Issue: Pages: 73 - 85
Abdollahi A.a van Dam E.R. Jazaeri M.
Hybrid GoldDOI:10.1007/s10623-016-0209-4Language: English

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. © 2016, The Author(s).


Author Keywords

Cayley graphDistance-regular graphEigenvaluesGeneralized polygonLine graphStrongly regular graph

Other Keywords

Eigenvalues and eigenfunctionsGraphic methodsCayley graphsDistance regular graphEigenvaluesGeneralized polygonsLine graphStrongly regular graphsGraph theory