Some spectral and quasi-spectral characterizations of distance-regular graphs

DOI10.1016/j.jcta.2016.04.004zbMath1342.05031arXiv1404.3973OpenAlexW2264563986MaRDI QIDQ530763

Aida Abiad, van Dam, Edwin R., Miquel Àngel Fiol

Publication date: 1 August 2016

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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

zbMATH Keywords

distance-regular grapheigenvaluesgirthodd-girthpreintersection numbers

Mathematics Subject Classification ID

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

Related Items

A Spectral Moore Bound for Bipartite Semiregular Graphs ⋮ Distance mean-regular graphs ⋮ Polynomial properties on large symmetric association schemes ⋮ Linear programming bounds for regular graphs ⋮ The Laplacian spectral excess theorem for distance-regular graphs ⋮ A spectral version of the Moore problem for bipartite regular graphs ⋮ Equivalent characterizations of the spectra of graphs and applications to measures of distance-regularity ⋮ Optimization of eigenvalue bounds for the independence and chromatic number of graph powers ⋮ 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
• A spectral excess theorem for nonregular graphs
• A short proof of the odd-girth theorem
• An odd characterization of the generalized odd graphs
• Characterizing distance-regularity of graphs by the spectrum
• A simple proof of the spectral excess theorem for distance-regular graphs
• The spectral excess theorem for distance-regular graphs: a global (over)view
• Developments on spectral characterizations of graphs
• Three-class association schemes
• Spectral characterization of some generalized odd graphs
• The Gewirtz graph: An exercise in the theory of graph spectra
• Problems in algebraic combinatorics
• Algebraic characterizations of distance-regular graphs
• From local adjacency polynomials to locally pseudo-distance-regular graphs
• Which graphs are determined by their spectrum?
• Spectral characterizations of some distance-regular graphs
• Distance-regularity and the spectrum of graphs
• Some families of orthogonal polynomials of a discrete variable and their applications to graphs and codes
• On almost distance-regular graphs
• On the Polynomial of a Graph
• Bounding the Valency of Polygonal Graphs With Odd Girth