The spectral radius and the maximum degree of irregular graphs

From MaRDI portal
Publication:2372882



Abstract: Let G be an irregular graph on n vertices with maximum degree Delta and diameter D. We show that Delta-lambda_1>frac{1}{nD} where lambda1 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.


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.




Cited in
(40)








This page was built for publication: The spectral radius and the maximum degree of irregular graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2372882)