Abstract. We prove that among unicyclic graphs on n vertices, Graovac-Pisanski index attains the maximum if the graph is a cycle on n vertices.