Distance-regular Cayley graphs with least eigenvalue -2

DOI10.1007/S10623-016-0209-4zbMATH Open1367.05098DBLPjournals/dcc/AbdollahiDJ17arXiv1512.06019OpenAlexW3106365748WikidataQ59515810 ScholiaQ59515810MaRDI QIDQ2364625FDOQ2364625

Alireza Abdollahi, Edwin R. Van Dam, Mojtaba Jazaeri

Publication date: 21 July 2017

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1512.06019

zbMATH Keywords

eigenvaluesstrongly regular graphCayley graphdistance-regular graphline graphgeneralized polygon

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Association schemes, strongly regular graphs (05E30) Distance in graphs (05C12) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Generalized quadrangles and generalized polygons in finite geometry (51E12)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Spectra of graphs
• A survey of partial difference sets
• Which graphs are determined by their spectrum?
• Primitive flag-transitive generalized hexagons and octagons.
• Graph derivatives
• Regular subgroups of primitive permutation groups
• Primitive permutation groups of odd degree, and an application to finite projective planes
• Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3
• Distance-regular graphs
• Finite projective planes, Fermat curves, and Gaussian periods
• Vertex-transitive graphs
• Which Cayley graphs are integral?
• Groups all of whose undirected Cayley graphs are integral
• Small vertex-transitive and Cayley graphs of girth six and given degree: an algebraic approach
• Finite primitive distance-transitive graphs
• More odd graph theory
• A remark on the general product of two infinite cyclic groups
• Generalised quadrangles with a group of automorphisms acting primitively on points and lines
• Geometric ABA-groups
• Distance-regular Cayley graphs on dihedral groups
• LOCALLY PRIMITIVE GRAPHS OF PRIME-POWER ORDER
• Distance-regular circulants
• On distance-regular Cayley graphs on abelian groups
• On Some Structural Properties of Star and Pancake Graphs
• On groups admitting no integral Cayley graphs besides complete multipartite graphs

Cited In (10)

• Non-bipartite distance-regular graphs with diameters 5, 6 and a smallest eigenvalue
• Eigenvalues of Cayley graphs
• Mixed graphs with smallest eigenvalue greater than \(- \frac{ \sqrt{ 5} + 1}{ 2} \)
• Characterizing signed mixed graphs with small eigenvalues
• On distance-regular Cayley graphs of generalized dicyclic groups
• On minimal distance-regular Cayley graphs of generalized dihedral groups
• Distance-regular Cayley graphs over dicyclic groups
• Mixed graphs whose Hermitian adjacency matrices of the second kind have the smallest eigenvalue greater than \(- \frac{3}{2}\)
• Distance-regular Cayley graphs with small valency
• Regular character-graphs whose eigenvalues are greater than or equal to \(-2\)

Uses Software

• GAP
• MathOverflow

This page was built for publication: Distance-regular Cayley graphs with least eigenvalue \(-2\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2364625)