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

DOI10.1016/J.LAA.2009.07.030zbMATH Open1221.05112OpenAlexW2040142338MaRDI QIDQ962132FDOQ962132

Authors: E. Garriga, Miquel Angel Fiol, Silvia Gago 

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

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

zbMATH Keywords

adjacency matrixdistance-regular graphspectrumexcesspredistance polynomials

Mathematics Subject Classification ID

Distance in graphs (05C12)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The spectral excess theorem for distance-regular graphs: a global (over)view
• Locally pseudo-distance-regular graphs
• From local adjacency polynomials to locally pseudo-distance-regular graphs
• On the Polynomial of a Graph
• Algebraic characterizations of distance-regular graphs
• Some families of orthogonal polynomials of a discrete variable and their applications to graphs and codes

Cited In (29)

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

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)