On the limiting distribution of the metric dimension for random forests
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 norm...
| Autores: | , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 2015 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/85108 |
| Acceso en línea: | https://hdl.handle.net/2117/85108 |
| Access Level: | acceso abierto |
| Palabra clave: | Random graphs random graphs metric dimension random trees analytic combinatorics Grafs, Teoria de Àrees temàtiques de la UPC::Matemàtiques i estadística |
| Sumario: | 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. |
|---|