Name
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 mertices 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). |
Year | Venue | Keywords |
|---|---|---|
2013 | ELECTRONIC JOURNAL OF COMBINATORICS | random graphs,diameter,metric dimension |
Field | DocType | Volume |
Graph center,Random regular graph,Discrete mathematics,Combinatorics,Metric k-center,Cycle graph,Neighbourhood (graph theory),Independent set,Packing dimension,Mathematics,Metric dimension | Journal | 20.0 |
Issue | ISSN | Citations |
4.0 | 1077-8926 | 9 |
PageRank | References | Authors |
0.79 | 11 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Béla Bollobás | 1 | 2696 | 474.16 |
| Dieter Mitsche | 2 | 141 | 26.08 |
| Pawel Pralat | 3 | 234 | 48.16 |