Multidiameters and multiplicities
DOI10.1006/EUJC.1999.0311zbMATH Open0937.05037OpenAlexW2095571416MaRDI QIDQ1817589FDOQ1817589
Authors: C. Delorme, Patrick Solé, Fan 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
Recommendations
distanceboundseigenvaluemultiplicitybinary codesphere packingHamming boundGilbert bounderror coefficientmultidiameter
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35) Distance in graphs (05C12) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Linear codes (general theory) (94B05) Bounds on codes (94B65)
Cites Work
- Title not available (Why is that?)
- Diameters and Eigenvalues
- An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with Its Laplacian
- Upper bounds for eigenvalues of the discrete and continuous Laplace operators
- Large Cayley graphs on an abelian group
- Diameter, covering index, covering radius and eigenvalues
- Large graphs with given degree and diameter. II
- Title not available (Why is that?)
Cited In (7)
- A new class of polynomials from the spectrum of a graph, and its application to bound the \(k\)-independence number
- Title not available (Why is that?)
- Title not available (Why is that?)
- Multisided generalisations of Gregory patches
- Title not available (Why is that?)
- Spectral bounds and distance-regularity
- Optimization of eigenvalue bounds for the independence and chromatic number of graph powers
This page was built for publication: Multidiameters and multiplicities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1817589)
