Eigenvalues, eigenspaces and distances to subsets

DOI10.1016/S0012-365X(96)00168-9zbMath0881.05087OpenAlexW1994672138MaRDI QIDQ1356741

Charles Delorme, Jean-Pierre Tillich

Publication date: 22 January 1998

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00168-9

zbMATH Keywords

covering radiuseigenvaluesdiametervertex-transitive grapherror-correcting codes

Mathematics Subject Classification ID

Linear programming (90C05) Bounds on codes (94B65) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)

Related Items

On the Laplacian Eigenvalues and Metric Parameters of Hypergraphs ⋮ From local adjacency polynomials to locally pseudo-distance-regular graphs ⋮ A new upper bound for the isoperimetric number of de Bruijn networks ⋮ On the spectra and spectral radii of token graphs ⋮ Shortest paths in distance-regular graphs ⋮ On perturbations of almost distance-regular graphs ⋮ 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ramanujan graphs
• Diameter, covering index, covering radius and eigenvalues
• Upper bounds on the covering radius of a code with a given dual distance
• On a class of polynomials and its relation with the spectra and diameters of graphs
• An Upper Bound on Covering Radius
• Diameters and Eigenvalues
• On the Shannon capacity of a graph
• An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with Its Laplacian
• Covering radius, codimension, and dual-distance width