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)$.
@article{10_37236_2639,
author = {B\'ela Bollob\'as and Dieter Mitsche and Pawe{\l} Pra{\l}at},
title = {Metric dimension for random graphs},
journal = {The electronic journal of combinatorics},
year = {2013},
volume = {20},
number = {4},
doi = {10.37236/2639},
zbl = {1295.05095},
url = {http://geodesic.mathdoc.fr/articles/10.37236/2639/}
}
TY - JOUR
AU - Béla Bollobás
AU - Dieter Mitsche
AU - Paweł Prałat
TI - Metric dimension for random graphs
JO - The electronic journal of combinatorics
PY - 2013
VL - 20
IS - 4
UR - http://geodesic.mathdoc.fr/articles/10.37236/2639/
DO - 10.37236/2639
ID - 10_37236_2639
ER -
%0 Journal Article
%A Béla Bollobás
%A Dieter Mitsche
%A Paweł Prałat
%T Metric dimension for random graphs
%J The electronic journal of combinatorics
%D 2013
%V 20
%N 4
%U http://geodesic.mathdoc.fr/articles/10.37236/2639/
%R 10.37236/2639
%F 10_37236_2639
Béla Bollobás; Dieter Mitsche; Paweł Prałat. Metric dimension for random graphs. The electronic journal of combinatorics, Tome 20 (2013) no. 4. doi: 10.37236/2639
