binary codeboundsdistanceeigenvalueerror coefficientGilbert boundHamming boundmultidiametermultiplicitysphere packing
Distance in graphs (05C12) Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Linear codes (general theory) (94B05) Bounds on codes (94B65)
Recommendations
Cites work
- An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with Its Laplacian
- Diameter, covering index, covering radius and eigenvalues
- Diameters and Eigenvalues
- scientific article; zbMATH DE number 4059445 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- Large Cayley graphs on an abelian group
- Large graphs with given degree and diameter. II
- Upper bounds for eigenvalues of the discrete and continuous Laplace operators
Cited in
(7)- Multisided generalisations of Gregory patches
- Spectral bounds and distance-regularity
- Optimization of eigenvalue bounds for the independence and chromatic number of graph powers
- A new class of polynomials from the spectrum of a graph, and its application to bound the \(k\)-independence number
- scientific article; zbMATH DE number 5507530 (Why is no real title available?)
- scientific article; zbMATH DE number 691463 (Why is no real title available?)
- scientific article; zbMATH DE number 7779492 (Why is no real title available?)
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)
