We consider simple connected graphs with a fixed number of negative eigenvalues (including their multiplicities). We show that these graphs have uniformly bounded numbers of positive eigenvalues, and the last numbers run over a set $[m]=\{1,2,\ldots,m\}$.