Using the eigenvalues and eigenvectors of a graph G, it was established the upper bound for the second eigenvalue $\lambda_2$ and the least eigenvalue $\lambda_n2$ [1]. In this work using only the eigenvalues of G we obtain the upper bound for $\lambda_2$ and $\lambda_n$.