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

From MaRDI portal
Revision as of 08:39, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    upper bound
    0 references
    eigenvalue
    0 references
    chromatic number
    0 references

    Identifiers