Eigenvalues and the diameter of graphs

DOI10.1080/03081089508818378MaRDI QIDQ4853924zbMATH OpenOpenAlexFDO

Authors Edwin R. Van Dam, Willem H. Haemers

Publication date 12 February 1996

Published in Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL https://research.tilburguniversity.edu/en/publications/8ed6c812-384b-42e1-a3ba-5d341564fc92

zbMATH Keywords

boundsChebyshev polynomialscovering radiusdiametereigenvalueerror-correcting codes

Mathematics Subject Classification ID

Distance in graphs (05C12) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Recommendations

• Eigenvalues, diameter, and mean distance in graphs
• The diameter and Laplacian eigenvalues of directed graphs
• Eigenvalues and extremal degrees of graphs
• Eigenvalues of finite graphs
• An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with Its Laplacian
• scientific article; zbMATH DE number 850069
• scientific article; zbMATH DE number 2149403
• Eigenvalues and the degree sequences of graphs
• scientific article; zbMATH DE number 907925
• scientific article; zbMATH DE number 1069214

Cites work

• Eigenvalues, diameter, and mean distance in graphs
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• Ramanujan graphs

Cited in

(29)

• On distance-regular graphs in which the neighborhood of each vertex is isomorphic to the Hoffman-Singleton graph
• Diameter, covering index, covering radius and eigenvalues
• Eigenvalues, diameter, and mean distance in graphs
• The alternating and adjacency polynomials, and their relation with the spectra and diameters of graphs
• Bounding the diameter and the mean distance of a graph from its eigenvalues: Laplacian versus adjacency matrix methods
• Eigenvalue interlacing and weight parameters of graphs
• The alternating polynomials and their relation with the spectra and conditional diameters of graphs
• Eigenvalues, eigenspaces and distances to subsets
• From local adjacency polynomials to locally pseudo-distance-regular graphs
• Boundary graphs. II: The limit case of a spectral property
• Bounds on special subsets in graphs, eigenvalues and association schemes
• Extremal properties of eigenvalues for a metric graph.
• Multidiameters and multiplicities
• Shortest paths in distance-regular graphs
• Connectivity and eigenvalues of graphs with given girth or clique number
• Eigenvalues of the k-th power of a graph
• scientific article; zbMATH DE number 5901910 (Why is no real title available?)
• Isoperimetric Inequalities and Eigenvalues
• Limit points of eigenvalues of (di)graphs
• Diameters and Eigenvalues
• scientific article; zbMATH DE number 1031379 (Why is no real title available?)
• scientific article; zbMATH DE number 1069214 (Why is no real title available?)
• On the Laplacian Eigenvalues and Metric Parameters of Hypergraphs
• On middle cube graphs
• A Family of Diameter-Based Eigenvalue Bounds for Quantum Graphs
• Eigenvalues and diameter
• Generalized Alon--Boppana Theorems and Error-Correcting Codes
• A spectral approach to polytope diameter
• The diameter and Laplacian eigenvalues of directed graphs

This page was built for publication: Eigenvalues and the diameter of graphs

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