Multidiameters and multiplicities

DOI10.1006/eujc.1999.0311zbMath0937.05037OpenAlexW2095571416MaRDI QIDQ1817589

Charles Delorme, Patrick Solé, Fan R. K. Chung

Publication date: 3 January 2000

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

Full work available at URL: https://semanticscholar.org/paper/354a82ac81862128bbea65afc48182cfd5d0a5c0

zbMATH Keywords

multiplicityeigenvaluedistanceboundsbinary codesphere packingHamming boundGilbert bounderror coefficientmultidiameter

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Linear codes (general theory) (94B05) Bounds on codes (94B65) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12)

Related Items (3)

A new class of polynomials from the spectrum of a graph, and its application to bound the \(k\)-independence number ⋮ Spectral bounds and distance-regularity ⋮ Optimization of eigenvalue bounds for the independence and chromatic number of graph powers

Cites Work

• Unnamed Item
• Unnamed Item
• Large graphs with given degree and diameter. II
• Diameter, covering index, covering radius and eigenvalues
• Large Cayley graphs on an abelian group
• Upper bounds for eigenvalues of the discrete and continuous Laplace operators
• Diameters and Eigenvalues
• An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with Its Laplacian

This page was built for publication: Multidiameters and multiplicities