Metric dimension for random graphs

From MaRDI portal
Publication:396907

zbMATH Open1295.05095arXiv1208.3801MaRDI QIDQ396907FDOQ396907


Authors: Béla Bollobás, D. Mitsche, Paweł Prałat Edit this on Wikidata


Publication date: 14 August 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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


Full work available at URL: https://arxiv.org/abs/1208.3801




Recommendations





Cited In (17)





This page was built for publication: Metric dimension for random graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q396907)