Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6424123 | European Journal of Combinatorics | 2015 | 22 Pages |
Abstract
The metric dimension of a graph G is the minimum size of a subset S of vertices 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 for two different models of random forests, in each case obtaining normal limit distributions for this parameter.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Dieter Mitsche, Juanjo Rué,