A sharp upper bound for the spectral radius of the Nordhaus-Gaddum type (Q1969793)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A sharp upper bound for the spectral radius of the Nordhaus-Gaddum type
scientific article

    Statements

    A sharp upper bound for the spectral radius of the Nordhaus-Gaddum type (English)
    0 references
    0 references
    0 references
    27 July 2000
    0 references
    An upper bound for the sum of the largest eigenvalue of a graph \(G\) and of its complement \(\overline G\) is derived. The bound depends on the chromatic number of \(G\) and of \(\overline G\) as well as on the number of vertices of \(G\).
    0 references
    0 references
    0 references
    0 references
    0 references
    upper bound
    0 references
    eigenvalue
    0 references
    chromatic number
    0 references
    0 references