A quasi-spectral characterization of strongly distance-regular graphs

zbMath0956.05103MaRDI QIDQ1583622

R. Smith

Publication date: 30 November 2000

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/120810

zbMATH Keywords

strongly regular graphdistance-regular graphsspectral characterization

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75)

Related Items (6)

The spectral excess theorem for distance-regular graphs having distance-\(d\) graph with fewer distinct eigenvalues ⋮ Spectra of strongly Deza graphs ⋮ The Laplacian spectral excess theorem for distance-regular graphs ⋮ Spectral bounds and distance-regularity ⋮ The spectral excess theorem for graphs with few eigenvalues whose distance-2 or distance-1-or-2 graph is strongly regular ⋮ Distance-regular graphs where the distance-\(d\) graph has fewer distinct eigenvalues

This page was built for publication: A quasi-spectral characterization of strongly distance-regular graphs