Resolvability in Nested triangle graph

Let $G$ be a graph on $n$ vertices and let $d(u,v)$ denote the distance between vertices $u$ and $v$. A subset $W\subseteq V(G)$ is a resolving set for $G$ if for every $u, v\in V(G)$ there exists $w\in W$ such that $d(u,w)\neq d(v, w)$. The metric dimension of $G$, denoted by $dim(G)$, is the minimum cardinality among resolving sets of $G$. \newline This parameter has many applications in chemistry, in networks and image processing. In this paper, we study the metric dimension of the Nested triangle graph. Also, other two variations of dimensional parameters including local metric dimension and adjacency metric dimension of Nested triangle graph have been studied.