FAQ

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

Topic mentions per year

Topic mentions per year

1992-2018
0102019922018

Related topics

Related topics

20 relations
AlgorithmicaApproximation algorithmCographComplex network zeta function
(More)

Related mentions per year

Related mentions per year

1936-2018
19401960198020002020
Metric dimension
Approximation algorithm
Planar graph
Graph theory
Greedy algorithm
ESA

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
On the metric dimension of bilinear forms graphs
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
The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases
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
On the metric dimension of corona product graphs
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
On the metric dimension of Grassmann graphs
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
On Approximation Complexity of Metric Dimension Problem
We study the approximation complexity of the Metric Dimension problem in bounded degree, dense as well as in general graphs. For… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2008
2008
On minimum metric dimension of honeycomb networks
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)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2007
Highly Cited
2007
On the Metric Dimension of Cartesian Products of Graphs
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)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2007
2007
Extremal Graph Theory for Metric Dimension and Diameter
A set of vertices S resolves a connected graph G if every vertex is uniquely determined by its vector of distances to the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2005
2005
On the metric dimension of some families of graphs
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
Resolvability in graphs and the metric dimension of a graph
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)
  • figure 1
  • figure 3
  • figure 4
  • figure 6
  • figure 8
Is this relevant?