Some sharp upper bounds on the spectral radius of graphs

From MaRDI portal
Publication:2479971





The authors prove a number of upper bounds on the spectral radius of adjacency matrix of a graph in terms of degree and average degree in the neighborhood of its vertices. The proofs rely on the relation between spectral radii of the adjacency matrix \(A\) and the signless Laplacian matrix \(Q=D+A\), where \(D\) is the diagonal matrix of vertex degrees.




Cited in
(33)








This page was built for publication: Some sharp upper bounds on the spectral radius of graphs

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