Metric dimension for random graphs (Q396907)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Metric dimension for random graphs |
scientific article; zbMATH DE number 6330332
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Metric dimension for random graphs |
scientific article; zbMATH DE number 6330332 |
Statements
Metric dimension for random graphs (English)
0 references
14 August 2014
0 references
Summary: 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)\).
0 references
random graphs
0 references
metric dimension
0 references
diameter
0 references
0 references
0.94341385
0 references
0.92952347
0 references
0.9220915
0 references
0 references
0 references
0 references
0.9096983
0 references
0 references
0.9068993
0 references
