Some sharp upper bounds on the spectral radius of graphs (Q2479971)

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.