A simple proof of the spectral excess theorem for distance-regular graphs

Recommendations

The spectral excess theorem for distance-regular graphs: a global (over)view
On a version of the spectral excess theorem
The Laplacian spectral excess theorem for distance-regular graphs
On some approaches to the spectral excess theorem for nonregular graphs
A spectral excess theorem for nonregular graphs

Cites work

Algebraic characterizations of distance-regular graphs
From local adjacency polynomials to locally pseudo-distance-regular graphs
scientific article; zbMATH DE number 43547 (Why is no real title available?)
scientific article; zbMATH DE number 3605240 (Why is no real title available?)
Locally pseudo-distance-regular graphs
On the Polynomial of a Graph
Some families of orthogonal polynomials of a discrete variable and their applications to graphs and codes
The spectral excess theorem for distance-regular graphs: a global (over)view

Cited in

(31)

The spectral excess theorem for distance-regular graphs: a global (over)view
Robust and adaptive control of an unknown plant: A benchmark of new format
Simple graph density inequalities with no sum of squares proofs
A lower bound for the discriminant of polynomials related to Chebyshev polynomials
The Laplacian spectral excess theorem for distance-regular graphs
On almost distance-regular graphs
A characterization of bipartite distance-regular graphs
Algebraic characterizations of regularity properties in bipartite graphs
On symmetric association schemes and associated quotient-polynomial graphs
Edge-distance-regular graphs are distance-regular
On some approaches to the spectral excess theorem for nonregular graphs
The spectral excess theorem for distance-biregular graphs.
On the local spectra of the subconstituents of a vertex set and completely pseudo-regular codes
A spectral equivalent condition of the P-polynomial property for association schemes
An excess theorem for spherical 2-designs
A spectral excess theorem for nonregular graphs
Dual concepts of almost distance-regularity and the spectral excess theorem
A short proof of the odd-girth theorem
A spectral excess theorem for normal digraphs
On a version of the spectral excess theorem
Equivalent characterizations of the spectra of graphs and applications to measures of distance-regularity
A spectral excess theorem for digraphs with normal Laplacian matrices
The spectral excess theorem for graphs with few eigenvalues whose distance-2 or distance-1-or-2 graph is strongly regular
Some spectral and quasi-spectral characterizations of distance-regular graphs
Edge-distance-regular graphs
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
An odd characterization of the generalized odd graphs
Polynomial characterizations of distance-biregular graphs
On the combinatorial structure and algebraic characterizations of distance-regular digraphs
A generalization of the odd-girth theorem

This page was built for publication: A simple proof of the spectral excess theorem for distance-regular graphs

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