The Szeged index is a new topological index based on distances between the vertices of a graph. The conjecture of Klavžar, Rajapakse and Gutman concerning graphs with the maximal value of the Szeged index is proved. More precisely, a complete bipartite graph K[p/2],[(p+l)/2] has the maximum Szeged index among all the connected graphs on p vertices
