A study on metric dimension of some families of graphs

Let S ⊆ V(G). Then S is said to resolve the whole graph G if every vertex in V(G) is uniquely determined by its distance-vector to all vertices in the set S. The minimum cardinality of a resolving set is called as the metric dimension of G and is denoted as β(G). This paper aims to determine the metric dimension of a few families of graphs.