An improved upper bound for Laplacian graph eigenvalues (Q1399250)

The author slightly improves a result of \textit{O. Rojo, R. Soto} and \textit{H. Rojo} in [Linear Algebra Appl. 312, 155-159 (2000; Zbl 0958.05088)] to show that \(\max\{d_i+d_j-|N_i\cap N_j|: 1\leq i<j \leq n\) and \(v_iv_j\in E \}\) is an upper bound for the largest eigenvalue of the Laplacian matrix of a simple graph \(G=(V,E)\), where \(V=\{v_1,v_2,\dots,v_n\}\), \(d_i\) is the degree of \(v_i\) and \(N_i\) is the set of neighbors of \(v_i\). The author gives one more upper bound in terms of \(d_i\) and \(|N_i\cap N_j|\).