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
Given any two vertices u, v of a random geometric graph G(n, r), denote by dE(u, v) their Euclidean ...
version plus longue de la version courte de GlobalSIPInternational audienceThe metric dimension of a...
In the localization game on a graph, the goal is to find a fixed but unknown target node v* with the...
International audienceThe metric dimension of a graph G is the minimum size of a subset S of vertice...
The metric dimension of a graph G is the minimum number of vertices in a subset S of the vertex set ...
In the paper ”On the limiting distribution of the metric dimension for random forests” the metric di...
Given a simple connected graph G(V,E), the edge metric dimension, denoted edim(G), is the least size...
We consider the Erdős–Rényi random graph G(n, p) inside the critical window, where p = 1/n + λn−4/...
The metric dimension (MD) of a graph is a combinatorial notion capturing the minimum number of landm...
It is well known that many random graphs with infinite variance degrees are ultra-small. More precis...
34 pages, 5 figuresInternational audienceWe consider the Erdos-Renyi random graph G(n,p) inside the ...
The metric dimension dim(G) of a graph G is the minimum cardinality of a subset S of vertices of G s...
Consider the minimum spanning tree (MST) of the complete graph with n vertices, when edges are assig...
We consider the Erdos-Renyi random graph G(n, p) inside the critical window, where p = 1/n + lambda ...
The metric dimension has been introduced independently by Harary, Melter [HM75] and Slater [Sla75] i...
Given any two vertices u, v of a random geometric graph G(n, r), denote by dE(u, v) their Euclidean ...
version plus longue de la version courte de GlobalSIPInternational audienceThe metric dimension of a...
In the localization game on a graph, the goal is to find a fixed but unknown target node v* with the...
International audienceThe metric dimension of a graph G is the minimum size of a subset S of vertice...
The metric dimension of a graph G is the minimum number of vertices in a subset S of the vertex set ...
In the paper ”On the limiting distribution of the metric dimension for random forests” the metric di...
Given a simple connected graph G(V,E), the edge metric dimension, denoted edim(G), is the least size...
We consider the Erdős–Rényi random graph G(n, p) inside the critical window, where p = 1/n + λn−4/...
The metric dimension (MD) of a graph is a combinatorial notion capturing the minimum number of landm...
It is well known that many random graphs with infinite variance degrees are ultra-small. More precis...
34 pages, 5 figuresInternational audienceWe consider the Erdos-Renyi random graph G(n,p) inside the ...
The metric dimension dim(G) of a graph G is the minimum cardinality of a subset S of vertices of G s...
Consider the minimum spanning tree (MST) of the complete graph with n vertices, when edges are assig...
We consider the Erdos-Renyi random graph G(n, p) inside the critical window, where p = 1/n + lambda ...
The metric dimension has been introduced independently by Harary, Melter [HM75] and Slater [Sla75] i...
Given any two vertices u, v of a random geometric graph G(n, r), denote by dE(u, v) their Euclidean ...
version plus longue de la version courte de GlobalSIPInternational audienceThe metric dimension of a...
In the localization game on a graph, the goal is to find a fixed but unknown target node v* with the...
Add to ORKG