Bounds on special subsets in graphs, eigenvalues and association schemes

DOI10.1023/A:1008675307444zbMath0974.05052MaRDI QIDQ1386530

van Dam, Edwin R.

Publication date: 15 July 1998

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

zbMATH Keywords

association schemeseigenvaluesdistanceboundLaplace spectrum

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)

Related Items (6)

Pseudo-Strong Regularity Around a Set ⋮ A characterization of distance-regular graphs with diameter three ⋮ The Laplacian spectral excess theorem for distance-regular graphs ⋮ Spectral bounds and distance-regularity ⋮ The alternating and adjacency polynomials, and their relation with the spectra and diameters of graphs ⋮ Eigenvalue interlacing and weight parameters of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Three-class association schemes
• A characterization of distance-regular graphs with diameter three
• Graphs with constant \(\mu\) and \(\overline{\mu}\)
• Small regular graphs with four eigenvalues
• Regular graphs with four eigenvalues
• Interlacing eigenvalues and graphs
• On a class of polynomials and its relation with the spectra and diameters of graphs
• An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with Its Laplacian
• Eigenvalues and the diameter of graphs
• A spectral approach to bandwidth and separator problems in graphs

This page was built for publication: Bounds on special subsets in graphs, eigenvalues and association schemes