Metric Dimension of a Class of Dendrimers

In an undirected graph G = (V,E), a set W ⊆ V is a resolving set for graph G, if for every two distinct vertices u,v ∈ V (G), there is a vertex w ∈ W such that d(u,w) ̸= d(v,w), where d(x, y) is distance between v and w . The metric dimension of graph G is the minimum cardinality of a resolving set for G. Dendrimers are hyperbranched molecules which are the class of polymeric materials. In this study, we determine the metric dimension of a class of dendrimers