Abstract
Let G be a connected graph and d(x, y) be the distance between the vertices x and y. A subset of vertices W = {w(1), w(2),..., w(k)} is called a resolving set for G if for every two distinct vertices x, y is an element of V(G), there is a vertex w(i) is an element of W such that d(x,wi) not equal d(y, we). A resolving set containing a minimum number of vertices is called a metric basis for G and the number of vertices in a metric basis is its metric dimension dim(C).
A family g of connected graphs is a family with constant metric dimension if dim(C) is finite and does not depend upon the choice of G in g. The metric dimension of some classes of plane graphs has been determined in [3], [4], [6], [12], [15] and [19]. We extend this study, by considering a class of plane graphs defined in [1] and two classes of plane graphs which are the convex polytopes defined in [2]. We show that these plane graphs have constant metric dimension and only three vertices appropriately chosen suffice to resolve all the vertices of these classes of plane graphs. It is natural to ask for the characterization of families of plane graphs with constant metric dimension.