  In this short paper we prove that the sum of the squares of negative (or
positive) eigenvalues of the adjacency matrix of a graph is lower bounded by
the sum of the degrees divided by the vector chromatic number, resolving a
conjecture by Wocjan, Elphick and Anekstein (2018).
