# 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… (More)
Wikipedia

1992-2018

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
• Discrete Mathematics
• 2012
In [R.F. Bailey, K. Meagher, On the metric dimension of Grassmann graphs, arXiv:1010.4495 ], Bailey and Meagher obtained an upper… (More)
Is this relevant?
2012
2012
• Algorithmica
• 2012
Given an input undirected graph $$G=(V,E)$$ G = ( V , E ) , we say that a vertex $$\ell$$ ℓ separates $$u$$ u from $$v$$ v… (More)
Is this relevant?
2011
2011
• Computers & Mathematics with Applications
• 2011
For an ordered set W = {w1, w2, · · · , wk} of vertices and a vertex v in a connected graph G, the representation of v with… (More)
Is this relevant?
2011
2011
• Discrete Mathematics & Theoretical Computer…
• 2011
The metric dimension of a graph Γ is the least number of vertices in a set with the property that the list of distances from any… (More)
Is this relevant?
2010
2010
• IWOCA
• 2010
We study the approximation complexity of the Metric Dimension problem in bounded degree, dense as well as in general graphs. For… (More)
Is this relevant?
2008
2008
• J. Discrete Algorithms
• 2008
A minimum metric basis is a minimum set W of vertices of a graph G(V,E) such that for every pair of vertices u and v of G, there… (More)
Is this relevant?
Highly Cited
2007
Highly Cited
2007
A set of vertices S resolves a graph G if every vertex is uniquely determined by its vector of distances to the vertices in S… (More)
Is this relevant?
2007
2007
• Electr. J. Comb.
• 2007
A set of vertices S resolves a connected graph G if every vertex is uniquely determined by its vector of distances to the… (More)
Is this relevant?
2005
2005
• Electronic Notes in Discrete Mathematics
• 2005
The concept of (minimum) resolving set has proved to be useful and/or related to a variety of fields such as Chemistry [3,6… (More)
Is this relevant?
Highly Cited
2000
Highly Cited
2000
• Discrete Applied Mathematics
• 2000
For an ordered subset W = {w1; w2; : : : ; wk} of vertices in a connected graph G and a vertex v of G, the metric representation… (More)
Is this relevant?