A characterization of distance-regular graphs with diameter three

DOI10.1023/A:1008626416743MaRDI QIDQ1361464zbMATH OpenFDO

Authors Willem H. Haemers, Edwin R. Van Dam

Publication date 9 November 1997

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

zbMATH Keywords

distancediameterspectrumstrongly regular graphseigenvalues of graphsdistance-regular graphs

Mathematics Subject Classification ID

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

Recommendations

• Distance-regularity and the spectrum of graphs
• scientific article; zbMATH DE number 4045789
• Distance-regular graphs with small number of distinct distance eigenvalues
• Characerization of a class of distance regular graphs.
• scientific article; zbMATH DE number 166076

Cites work

• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• Bounds on special subsets in graphs, eigenvalues and association schemes
• Distance-regularity and the spectrum of graphs
• Interlacing eigenvalues and graphs
• On the Polynomial of a Graph
• Regular graphs with four eigenvalues

Cited in

(22)

• Characerization of a class of distance regular graphs.
• A new characterization of taut distance-regular graphs of odd diameter
• Distance-regular graphs with diameter 3 and eigenvalue \(a_2 - c_3\)
• 3-bounded property in a triangle-free distance-regular graph
• Spectral bounds and distance-regularity
• Extremal 1-codes in distance-regular graphs of diameter 3
• On bounding the diameter of a distance-regular graph
• Pseudo-Strong Regularity Around a Set
• From local adjacency polynomials to locally pseudo-distance-regular graphs
• Three distance characteristic polynomials of some graphs
• scientific article; zbMATH DE number 4045789 (Why is no real title available?)
• The Laplacian spectral excess theorem for distance-regular graphs
• Normal quotients of diameter at most two of finite three-geodesic-transitive graphs
• Characterization of \(n\)-vertex graphs with metric dimension \({n-3}\).
• Spectral determinations and eccentricity matrix of graphs
• Three-class association schemes
• DDR Graphs of Diameter Three
• On 3-chromatic distance-regular graphs
• Bounds on special subsets in graphs, eigenvalues and association schemes
• Distance hereditary graphs \(G\) of connectivity two or three and \(\operatorname{diam} (G) = \operatorname{diam} (\overline{G}) = 3\) are reconstructible
• Neumaier graphs with few eigenvalues
• On diameter three distance degree regular graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1361464)