A new upper bound for eigenvalues of the laplacian matrix of a graph

We first give a result on eigenvalues of the line graph of a graph. We then use the result to present a new upper bound for eigenvalues of the Laplacian matrix of a graph. Moreover we determine all graphs the largest eigenvalue of whose Laplacian matrix reaches the upper bound.