On a conjecture of V. Nikiforov

In this paper we will prove that μ(G)+μ(G¯)≤1+32n−1. where μ(G),μ(G¯) are the greatest eigenvalues of the adjacency matrices of the graph GG and its complement and nn denotes the number of vertices of GG.