A new upper bound for eigenvalues of the Laplacian matrix of a graph
A new upper bound for the eigenvalues of the Laplacian matrix of a graph is proved, and all graphs meeting the bound are determined. The bound is based on a result about the eigenvalues of the line graph.
scientific article; zbMATH DE number 1076371