pith. sign in

arxiv: 1309.2000 · v2 · pith:O4BQB4S4new · submitted 2013-09-08 · 🧮 math.CO

On the limiting distribution of the metric dimension for random forests

classification 🧮 math.CO
keywords dimensionmetricverticesforestsrandomcasedetermineddifferent
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.