B. Bollobas, D. Mitsche, P. Pralat
Published 2012-08-19, updated 2014-06-11Version 3
The metric dimension of a graph $G$ is the minimum number of vertices in a subset $S$ of the vertex set of $G$ such that all other vertices are uniquely determined by their distances to the vertices in $S$. In this paper we investigate the metric dimension of the random graph $G(n,p)$ for a wide range of probabilities $p=p(n)$.
Bounds on metric dimension for families of planar graphs
On the Metric Dimension of $K_a \times K_b \times K_c$
On the metric dimension of Grassmann graphs
![QR code for arXiv:1208.3801 [math.CO]](http://oss.arxitics.com/images/favicon.svg)