A characterization of distance-regular graphs with diameter three

DOI10.1023/A:1008626416743zbMath0874.05060MaRDI QIDQ1361464

Willem H. Haemers, van Dam, Edwin R.

Publication date: 9 November 1997

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

zbMATH Keywords

strongly regular graphsdistance-regular graphsspectrumdistancediametereigenvalues of graphs

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) Distance in graphs (05C12)

Related Items (9)

Pseudo-Strong Regularity Around a Set ⋮ On bounding the diameter of a distance-regular graph ⋮ From local adjacency polynomials to locally pseudo-distance-regular graphs ⋮ Neumaier graphs with few eigenvalues ⋮ Bounds on special subsets in graphs, eigenvalues and association schemes ⋮ Spectral determinations and eccentricity matrix of graphs ⋮ The Laplacian spectral excess theorem for distance-regular graphs ⋮ Spectral bounds and distance-regularity ⋮ Three-class association schemes

Cites Work

• Unnamed Item
• Bounds on special subsets in graphs, eigenvalues and association schemes
• Regular graphs with four eigenvalues
• Interlacing eigenvalues and graphs
• Distance-regularity and the spectrum of graphs
• On the Polynomial of a Graph

This page was built for publication: A characterization of distance-regular graphs with diameter three