Consider a graph $G$ with $n$ vertices and $m$ edges. If the eigenvalues of the adjacency matrix are $\lambda_1 \geq \lambda_2 \geq \dots \geq \lambda_n$, what is the sum of the squares of the eigenvalues $\sum_{i=1}^{n} \lambda_i^2$?