Metric Dimension for Random Graphs
Keyword(s):
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)$.
1975 ◽
Vol 77
(2)
◽
pp. 313-324
◽
2013 ◽
Vol 05
(04)
◽
pp. 1250060
◽
2006 ◽
Vol 38
(02)
◽
pp. 287-298
◽
1984 ◽
Vol 96
(1)
◽
pp. 151-166
◽
Keyword(s):
Keyword(s):
2006 ◽
Vol 38
(2)
◽
pp. 287-298
◽
2011 ◽
Vol 20
(5)
◽
pp. 763-775
◽
Keyword(s):
2018 ◽
Keyword(s):