Abstract
Consider a simple connected graph G = (V(G),E(G)), where V(G) represents the vertex set and E (G) represents the edge set respectively. A subset W of V(G) is called a resolving set for a graph G if for every two distinct vertices x, y ∈ V (G), there exist some vertex w e W such that d(x, w) ≠ d(y, w), where d(u, v) denotes the distance between vertices u and v. A resolving set of minimal cardinality is called a metric basis for G and its cardinality is called the metric dimension of G, which is denoted by β(G). A subset D of V(G) is called a doubly resolving set of G if for every two distinct vertices x,y of G, there are two vertices u,v ∈ D such that d(u,x) - d(u,y) ≠ d(v,x) - d(v,y). A doubly resolving set with minimum cardinality is called minimal doubly resolving set. This minimum cardinality is denoted by ψ(G). In this paper, we determine the minimal doubly resolving sets for antiprism graphs denoted by An with n ≥ 3 and for Möbius ladders denoted by Mn, for every even positive integer n ≥ 8. It has been proved that ψ(An) = 3 for n ≥ 3 and ... for every even positive integer n ≥ 8.