Abstract
For a connected graph G, a subset W = {w(1), w(2), w(3),...,w(xi)} of the vertices of G is the resolving set for G if for a, b is an element of V(G), we have d(a, w(xi)) not equal d(b, w(xi)) for all w(xi) is an element of W. Metric basis for G is the minimum number of vertices in W and metric dimension is the cardinality of such a set denoted by beta(G). In this paper we compute the metric dimension of P(n,2) circle dot K-1.