Breaking Symmetry in Graphs by Resolving Sets

Meysam Korivand, Nasrin Soltankhah, Sandi Klavžar

Let $\dim (G)$ and $D(G)$ respectively denote the metric dimension and the distinguishing number of a graph $G$. It is proved that $D(G)\le \dim (G)+1$ holds for every con…