Abstract. For every integer k>1 we find an infinite class of graphs G with diameter k, with the trivial group of automorphisms, for which the sum of distances dist_G(u,v), where v runs through all vertices of V(G)-{u} (as well as the sum of reciprocals of these summands), does not depend on the choice of u.