Uniquely dimensional graphs

Behrooz Bagheri, Mohsen Jannesari, Behnaz Omoomi

A set $W\subseteq V(G)$ is called a resolving set, if for each two distinct vertices $u,v\in V(G)$ there exists $w\in W$ such that $d(u,w)\ne d(v,w)$, where $d(x,y)$ is the distan…