Eigenvalues and the diameter of graphs
From MaRDI portal
Publication:4853924
DOI10.1080/03081089508818378zbMath0831.05046OpenAlexW3122017798MaRDI QIDQ4853924
van Dam, Edwin R., 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
Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)
Related Items
On the Laplacian Eigenvalues and Metric Parameters of Hypergraphs ⋮ The alternating polynomials and their relation with the spectra and conditional diameters of graphs ⋮ 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 ⋮ Shortest paths in distance-regular graphs ⋮ The alternating and adjacency polynomials, and their relation with the spectra and diameters of graphs ⋮ On distance-regular graphs in which the neighborhood of each vertex is isomorphic to the Hoffman-Singleton graph ⋮ 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 ⋮ On Middle Cube Graphs
Cites Work
