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

DOI10.1016/j.endm.2015.06.064zbMath1346.05163OpenAlexW2595439375MaRDI QIDQ5890916

No author found.

Publication date: 14 October 2016

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2015.06.064

zbMATH Keywords

distance-regular graphspectrumKneser graphpartial antipodalitypredistance polynomials

Mathematics Subject Classification ID

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

Cites Work

• 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
• Problems in algebraic combinatorics
• From local adjacency polynomials to locally pseudo-distance-regular graphs
• Distance-regular graphs where the distance-\(d\) graph has fewer distinct eigenvalues
• Some Spectral Characterizations of Strongly Distance-Regular Graphs

This page was built for publication: The spectral excess theorem for distance-regular graphs having distance-\(d\) graph with fewer distinct eigenvalues