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)
Abstract: A graph G = (V, E) is a non-empty collection of vertices and edges, where V is the vertex ...
The random graph order P n, p is obtained from a random graph G n, p on [n] by treating an edge betw...
As a generalization of the concept of a metric basis, this article introduces the notion of k-metric...
The metric dimension of a graph G is the minimum number of vertices in a subset S of the vertex set ...
The metric dimension of a graph G is the minimum size of a subset S of vertices of G such that all o...
Given a simple connected graph G(V,E), the edge metric dimension, denoted edim(G), is the least size...
In the localization game on a graph, the goal is to find a fixed but unknown target node v* with the...
Given any two vertices u, v of a random geometric graph G(n, r), denote by dE(u, v) their Euclidean ...
AbstractFor an ordered set W={w1,w2,…,wk} of vertices and a vertex v in a connected graph G, the ord...
version plus longue de la version courte de GlobalSIPInternational audienceThe metric dimension of a...
Abstract. The inductive dimension dim(G) of a finite undirected graph G is a rational number defined...
The metric dimension (MD) of a graph is a combinatorial notion capturing the minimum number of landm...
A metric graph is a 1-dimensional stratified metric space consisting of vertices and edges or loops ...
Let n be a positive integer, λ> 0 a real number, and 1≤ p≤ ∞. We study the unit disk random geometri...
The distance sequence of a vertex x of a graph is (di(x))n1 where di(x) is the number of vertices at...
Abstract: A graph G = (V, E) is a non-empty collection of vertices and edges, where V is the vertex ...
The random graph order P n, p is obtained from a random graph G n, p on [n] by treating an edge betw...
As a generalization of the concept of a metric basis, this article introduces the notion of k-metric...
The metric dimension of a graph G is the minimum number of vertices in a subset S of the vertex set ...
The metric dimension of a graph G is the minimum size of a subset S of vertices of G such that all o...
Given a simple connected graph G(V,E), the edge metric dimension, denoted edim(G), is the least size...
In the localization game on a graph, the goal is to find a fixed but unknown target node v* with the...
Given any two vertices u, v of a random geometric graph G(n, r), denote by dE(u, v) their Euclidean ...
AbstractFor an ordered set W={w1,w2,…,wk} of vertices and a vertex v in a connected graph G, the ord...
version plus longue de la version courte de GlobalSIPInternational audienceThe metric dimension of a...
Abstract. The inductive dimension dim(G) of a finite undirected graph G is a rational number defined...
The metric dimension (MD) of a graph is a combinatorial notion capturing the minimum number of landm...
A metric graph is a 1-dimensional stratified metric space consisting of vertices and edges or loops ...
Let n be a positive integer, λ> 0 a real number, and 1≤ p≤ ∞. We study the unit disk random geometri...
The distance sequence of a vertex x of a graph is (di(x))n1 where di(x) is the number of vertices at...
Abstract: A graph G = (V, E) is a non-empty collection of vertices and edges, where V is the vertex ...
The random graph order P n, p is obtained from a random graph G n, p on [n] by treating an edge betw...
As a generalization of the concept of a metric basis, this article introduces the notion of k-metric...
DOI
Add to ORKG