The distance d(va, vb) between two vertices of a simple connected graph G is the length of the shortest path between va and vb. Vertices va, vb of G are considered to be resolved by a vertex v if d(va, v) 6= d(vb, v). An ...