The spectral excess theorem for distance-regular graphs having distance-\(d\) graph with fewer distinct eigenvalues

DOI10.1007/s10801-015-0654-6zbMath1339.05090arXiv1409.5146OpenAlexW2471565594MaRDI QIDQ5890763

No author found.

Publication date: 13 June 2016

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

distance-regular graphspectrumKneser graphpartial antipodalitypredistance polynomials

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)

Related Items

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
• Distance-regular graphs
• Spectra of graphs
• A simple proof of the spectral excess theorem for distance-regular graphs
• The spectral excess theorem for distance-regular graphs: a global (over)view
• Locally pseudo-distance-regular graphs
• Algebraic characterizations of distance-regular graphs
• From local adjacency polynomials to locally pseudo-distance-regular graphs
• An eigenvalue characterization of antipodal distance-regular graphs
• A quasi-spectral characterization of strongly distance-regular graphs
• Distance-regular graphs where the distance-\(d\) graph has fewer distinct eigenvalues
• Some families of orthogonal polynomials of a discrete variable and their applications to graphs and codes
• On almost distance-regular graphs
• Some Spectral Characterizations of Strongly Distance-Regular Graphs
• On the Polynomial of a Graph
• PRIMITIVE AND IMPRIMITIVE GRAPHS