Let (G) e a finite, simple and connected graph. As usual, the distance between two vertices and is denoted by , or simply if the graph is clear. A vertex is said to resolve a pair if . So, a set of vertices in a graph is a resolving set for if for any two vertices and , there exists uch that .