The spectral radius and the maximum degree of irregular graphs (Q2372882)

From MaRDI portal
Revision as of 07:54, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
The spectral radius and the maximum degree of irregular graphs
scientific article

    Statements

    The spectral radius and the maximum degree of irregular graphs (English)
    0 references
    16 July 2007
    0 references
    Summary: Let \(G\) be an irregular graph on \(n\) vertices with maximum degree \(\Delta\) and diameter \(D\). We show that \[ \Delta-\lambda_1>{1\over nD}, \] where \(\lambda_1\) is the largest eigenvalue of the adjacency matrix of \(G\). We also study the effect of adding or removing few edges on the spectral radius of a regular graph.
    0 references
    0 references