A characterization of distance-regular graphs with diameter three

DOI10.1023/A:1008626416743zbMATH Open0874.05060MaRDI QIDQ1361464FDOQ1361464

Willem H. Haemers, Edwin R. Van Dam

Publication date: 9 November 1997

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

Recommendations

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

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)

Cites Work

• Title not available (Why is that?)
• Interlacing eigenvalues and graphs
• On the Polynomial of a Graph
• Regular graphs with four eigenvalues
• Distance-regularity and the spectrum of graphs
• Bounds on special subsets in graphs, eigenvalues and association schemes

Cited In (20)

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

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)