For a simple connected graph G=(V,E), an ordered set W⊆V, is called resolving of G if for every pair two distinct vertices u and v, there element w in W such that d(u,w)≠d(v,w). A metric basis with minimum cardinality. The dimension the cardinality it denoted by β(G). In this article, we determine power finite paths characterize all bases same.
