Upper bound for the Laplacian graph eigenvalues
The authors present two new upper bounds for the largest Laplacian eigenvalue of a connected graph, in terms of the largest and smallest degrees, and the numbers of vertices and edges of the graph. They also determine the extremal graphs which achieve the upper bounds.
scientific article; zbMATH DE number 2174193