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)

(More)

Semantic Scholar uses AI to extract papers important to this topic.

2012

2012

- Min Feng, Kaishun Wang
- 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

- Leah Epstein, Asaf Levin, Gerhard J. Woeginger
- 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

- Ismael GonzÃ¡lez Yero, Dorota Kuziak, Juan A. RodrÃguez-VelÃ¡zquez
- 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

- Robert F. Bailey, Karen Meagher
- 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

- Mathias Hauptmann, Richard Schmied, Claus Viehmann
- 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

- Paul D. Manuel, Bharati Rajan, Indra Rajasingh, Chris Monica M.
- 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

- JosÃ© CÃ¡ceres, M. Carmen Hernando, +4 authors David R. Wood
- SIAM J. Discrete Math.
- 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

- M. Carmen Hernando, MercÃ¨ Mora, Ignacio M. Pelayo, Carlos Seara, David R. Wood
- 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

- M. Carmen Hernando, MercÃ¨ Mora, Ignacio M. Pelayo, Carlos Seara, JosÃ© CÃ¡ceres, MarÃa Luz Puertas
- 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

- Gary Chartrand, Linda Eroh, Mark A. Johnson, Ortrud R. Oellermann
- 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?