Skip to search formSkip to main contentSkip to account menu

Metric dimension (graph theory)

Known as: Metric dimension 
In graph theory, the metric dimension of a graph G is the minimum cardinality of a subset S of vertices such that all other vertices are uniquely… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
The concept of metric dimension was proposed to model robot navigation where the places of navigating agents can change among… 
2015
2015
A distance between two vertices of a connected graph is the shortest distance between them. The metric dimension of a connected… 
2014
2014
Let $D$ be a strongly connected oriented graph with vertex-set $V$ and arc-set $A$. The distance from a vertex $u$ to another… 
2013
2013
If every vertex is uniquely determined by its vector of distances to the vertices in W,the graph G is resolved by a set of… 
2011
2011
For an ordered set W = {w1, w2, . . . , wk} of vertices and a vertex v in a connected graph G, the ordered k-vector r(v|W ) := (d… 
2010
2010
A subset of vertices S resolves a graph G if every vertex of G is uniquely determined by its vector of distances to the vertices… 
2001
2001
Fringe Projection systems generate phase distributions of an object illuminated with a specific fringe pattern. These phase… 
1993
1993
For every integer m, k, and n such that 0 ≤ m ≤ n − 1 and m ≤ k ≤ min{2m, n − 1}, we construct a subspace S m,k n = in Euclidean…