Abstract. The total distance (or Wiener index) W(G) of a graph G, is the sum of the distances in G. We study graphs G having a vertex v such that W(G)=W(G-v). In this paper we summarize our recent results on this topic.