A bound on the spectral radius of graphs (Q1109050)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A bound on the spectral radius of graphs
scientific article

    Statements

    A bound on the spectral radius of graphs (English)
    0 references
    0 references
    1988
    0 references
    Let G be a simple connected graph with n vertices and m edges. Let A be the adjacency matrix of G. The spectral radius \(\rho\) (A) of A satisfies \(\rho (A)\leq \sqrt{2m-n+1}\) with equality if and only if G is isomorphic to one of the following two graphs: (a) star \(K_{1,n-1}\); (b) the complete graph \(K_ n\).
    0 references
    0 references
    adjacency matrix
    0 references
    spectral radius
    0 references
    0 references