A simple proof of the spectral excess theorem for distance-regular graphs
From MaRDI portal
Publication:962132
DOI10.1016/j.laa.2009.07.030zbMath1221.05112OpenAlexW2040142338MaRDI QIDQ962132
E. Garriga, Silvia Gago, Miquel Àngel Fiol
Publication date: 6 April 2010
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2009.07.030
Related Items (26)
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 ⋮ A generalization of the odd-girth theorem ⋮ On almost distance-regular graphs ⋮ 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 ⋮ On symmetric association schemes and associated quotient-polynomial graphs ⋮ A characterization of bipartite 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 ⋮ A lower bound for the discriminant of polynomials related to Chebyshev polynomials ⋮ A spectral excess theorem for normal digraphs ⋮ The Laplacian spectral excess theorem for distance-regular graphs ⋮ Some spectral and quasi-spectral characterizations of distance-regular graphs ⋮ Edge-distance-regular graphs ⋮ A spectral excess theorem for digraphs with normal Laplacian matrices ⋮ Algebraic characterizations of regularity properties in bipartite graphs ⋮ Equivalent characterizations of the spectra of graphs and applications to measures of distance-regularity ⋮ On a version of the spectral excess theorem ⋮ The spectral excess theorem for graphs with few eigenvalues whose distance-2 or distance-1-or-2 graph is strongly regular ⋮ Robust and adaptive control of an unknown plant: A benchmark of new format
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Some families of orthogonal polynomials of a discrete variable and their applications to graphs and codes
- On the Polynomial of a Graph
This page was built for publication: A simple proof of the spectral excess theorem for distance-regular graphs
