Distance-regular graphs where the distance-\(d\) graph has fewer distinct eigenvalues

DOI10.1016/j.laa.2015.04.020zbMath1314.05053arXiv1409.0389OpenAlexW2166313678MaRDI QIDQ2348937

Yanyan Li

Publication date: 16 June 2015

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

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

zbMATH Keywords

distance-regular graphBose-Mesner algebraKneser graphhalf-antipodality

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)

Related Items (6)

Unnamed Item ⋮ A survey on the missing Moore graph ⋮ The spectral excess theorem for distance-regular graphs having distance-\(d\) graph with fewer distinct eigenvalues ⋮ The spectral excess theorem for distance-regular graphs having distance-\(d\) graph with fewer distinct eigenvalues ⋮ Hyperplane sections of determinantal varieties over finite fields and linear codes ⋮ The spectral excess theorem for graphs with few eigenvalues whose distance-2 or distance-1-or-2 graph is strongly regular

Cites Work

• Unnamed Item
• Unnamed Item
• A quasi-spectral characterization of strongly distance-regular graphs
• Some Spectral Characterizations of Strongly Distance-Regular Graphs

This page was built for publication: Distance-regular graphs where the distance-\(d\) graph has fewer distinct eigenvalues