A new upper bound on the largest normalized Laplacian eigenvalue (Q2852253)

The authors prove that the largest normalized Laplacian eigenvalue \(\lambda_1\) of a simple connected graph \(G\) is bounded from above by NEWLINE\[NEWLINE 2-\min_{i\sim j} \left\{ \frac{|N_i\cap N_j|}{\max\{d_i,d_j\}} \right\}, NEWLINE\]NEWLINE where the minimum is taken over all pairs of adjacent vertices \(i\), \(j\) (here \(N_i\) is the set of vertices adjacent to \(i\) and \(d_i=|N_i|\) is the degree of \(i\)).