Thumbnail Image
Item

Distance-regular Cayley graphs with least eigenvalue -2

van Dam,Edwin R.
; 
Abdollahi,Alireza
; 
Jazaeri,Mojtaba
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.
Description
Date
2017
Journal Title
Journal ISSN
Volume Title
Publisher
Collections
Tilburg University Research Output Collection
Show all metadata
Files
Thumbnail Image
Distance_regular_Cayley_graphs.pdf
Adobe PDF, 442.19 KB
Research Projects
Organizational Units
Journal Issue
Keywords
Cayley graph, strongly regular graph, distance-regular graph, line graph, generalized polygon, eigenvalues
Citation
van Dam, E R, Abdollahi, A & Jazaeri, M 2017, 'Distance-regular Cayley graphs with least eigenvalue -2', Designs Codes and Cryptography, vol. 84, no. 1-2, pp. 73-85. https://doi.org/10.1007/s10623-016-0209-4
URI
https://hdl.handle.net/20.500.14602/66898
Embedded videos