Bounds on graph eigenvalues (Q909674)

From MaRDI portal
Revision as of 00:44, 7 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
Bounds on graph eigenvalues
scientific article

    Statements

    Bounds on graph eigenvalues (English)
    0 references
    0 references
    1989
    0 references
    This note is a nice, condensed survey on recent results in finding upper and lower estimates for the maximum of the k-th eigenvalue of a graph as function of the number of vertices or edges. For connected graphs, some new bounds in terms of the number of vertices are derived.
    0 references
    survey
    0 references
    upper and lower estimates
    0 references
    eigenvalue of a graph
    0 references
    number of vertices
    0 references

    Identifiers