Eigenvalues, eigenspaces and distances to subsets (Q1356741)

From MaRDI portal
Revision as of 10:49, 19 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Eigenvalues, eigenspaces and distances to subsets
scientific article

    Statements

    Eigenvalues, eigenspaces and distances to subsets (English)
    0 references
    0 references
    0 references
    22 January 1998
    0 references
    The authors show how to improve certain, previously known, graph eigenvalues based calculations yielding upper bounds for the diameter of a vertex-transitive graph. Also upper bounds for the covering radius of error-correcting codes are derived.
    0 references
    eigenvalues
    0 references
    diameter
    0 references
    vertex-transitive graph
    0 references
    covering radius
    0 references
    error-correcting codes
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references