Metric dimension for random graphs

B. Bollobas; D. Mitsche; P. Pralat

Metric dimension for random graphs

Combinatorics 2014-06-12 v3

Authors: B. Bollobas , D. Mitsche , P. Pralat

Abstract

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)$ .

Keywords

graph pebbling random graphs mean dimension

Cite

@article{arxiv.1208.3801,
  title  = {Metric dimension for random graphs},
  author = {B. Bollobas and D. Mitsche and P. Pralat},
  journal= {arXiv preprint arXiv:1208.3801},
  year   = {2014}
}

Related papers

View all related →