Lower bounds on the spectra of symmetric matrices with nonnegative entries (Q1070312)

From MaRDI portal
Revision as of 21:49, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Lower bounds on the spectra of symmetric matrices with nonnegative entries
scientific article

    Statements

    Lower bounds on the spectra of symmetric matrices with nonnegative entries (English)
    0 references
    1985
    0 references
    Let G be a simple graph on v vertices and A(G) its adjacency matrix. Let \(\lambda_ 1(G)\leq...\leq \lambda_ v(G)\) be the eigenvalues of A(G). This paper deals with the problem of finding sharp lower bounds for \(\lambda_ 1(G)\). As an example we mention the result stating that if \(v=2n\), then \(\lambda_ 1(G)\geq -n\) and is equal to -n if and only if G is isomorphic to the graph \(K_{n,n}\). A similar result is proved for \(v=2n+1\). The paper ends with bounds for the minimal eigenvalue of a symmetric nonnegative matrix.
    0 references
    adjacency matrices of complete bipartite graphs
    0 references
    simple graph
    0 references
    bounds
    0 references
    minimal eigenvalue
    0 references
    symmetric nonnegative matrix
    0 references

    Identifiers