Spectral characterizations of some distance-regular graphs

DOI10.1023/A:1013847004932zbMath0993.05149OpenAlexW1546248008WikidataQ56001779 ScholiaQ56001779MaRDI QIDQ1597526

Willem H. Haemers, van Dam, Edwin R.

Publication date: 30 May 2002

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1013847004932

zbMATH Keywords

distance-regular graphseigenvaluesspectrumadjacency matrixGolay code

Mathematics Subject Classification ID

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

Related Items

A Spectral Moore Bound for Bipartite Semiregular Graphs, The generalized distance spectrum of a graph and applications, Regular graphs with girth at least 5 and small second largest eigenvalue, Characterizing distance-regularity of graphs by the spectrum, Distance-regular graphs with small number of distinct distance eigenvalues, On some distance-regular graphs with many vertices, INVESTIGATION OF CONTINUOUS-TIME QUANTUM WALKS VIA SPECTRAL ANALYSIS AND LAPLACE TRANSFORM, Which graphs are determined by their spectrum?, Unnamed Item, Some spectral and quasi-spectral characterizations of distance-regular graphs, Spectral bounds and distance-regularity, Equivalent characterizations of the spectra of graphs and applications to measures of distance-regularity, Periodicity of Grover walks on bipartite regular graphs with at most five distinct eigenvalues

Cites Work

• Unnamed Item
• Constructing cospectral graphs
• A distance-regular graph with intersection array (5,4,3,3; 1,1,1,2) does not exist
• Spectral characterization of some generalized odd graphs
• The Gewirtz graph: An exercise in the theory of graph spectra
• From local adjacency polynomials to locally pseudo-distance-regular graphs
• Distance-regularity and the spectrum of graphs
• On the Polynomial of a Graph
• Graphs cospectral with distance-regular graphs