Bounds on special subsets in graphs, eigenvalues and association schemes

DOI10.1023/A:1008675307444MaRDI QIDQ1386530zbMATH OpenFDO

Authors Edwin R. Van Dam

Publication date 15 July 1998

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

Full work available at URL https://doi.org/10.1023/A:1008675307444

zbMATH Keywords

association schemesbounddistanceeigenvaluesLaplace spectrum

Mathematics Subject Classification ID

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

Recommendations

• Eigenvalue bounds for some classes of matrices associated with graphs
• Bounds on graph eigenvalues
• Bounds on graph eigenvalues. II
• Bounds of eigenvalues of graphs
• scientific article; zbMATH DE number 3968623
• Bounds for the number of mappings of graphs and for the number of subgraphs
• Bounds on graph spectra
• Bounds on the subdominant eigenvalue involving group inverse with applications to graphs
• Bounds on graph eigenvalues. I
• Some bounds on the largest eigenvalues of graphs

Cites work

• A characterization of distance-regular graphs with diameter three
• A spectral approach to bandwidth and separator problems in graphs
• An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with Its Laplacian
• Eigenvalues and the diameter of graphs
• Graphs with constant \(\mu\) and \(\overline{\mu}\)
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• scientific article; zbMATH DE number 48688 (Why is no real title available?)
• scientific article; zbMATH DE number 194751 (Why is no real title available?)
• Interlacing eigenvalues and graphs
• On a class of polynomials and its relation with the spectra and diameters of graphs
• Regular graphs with four eigenvalues
• Small regular graphs with four eigenvalues
• Three-class association schemes

Cited in

(9)

• The alternating and adjacency polynomials, and their relation with the spectra and diameters of graphs
• Eigenvalue interlacing and weight parameters of graphs
• A characterization of distance-regular graphs with diameter three
• Spectral bounds and distance-regularity
• The Laplacian spectral excess theorem for distance-regular graphs
• Polynomial properties on large symmetric association schemes
• Pseudo-Strong Regularity Around a Set
• Independent sets in association schemes
• Linear programming bounds for regular graphs

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

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