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.

2017

2017

- Rémy Belmonte, Fedor V. Fomin, Petr A. Golovach, M. S. Ramanujan
- SIAM J. Discrete Math.
- 2017

The notion of resolving sets in a graph was introduced by Slater (1975) and Harary and Melter (1976) as a way of uniquely… (More)

Is this relevant?

2013

2013

- Béla Bollobás, Dieter Mitsche, Pawel Pralat
- Electr. J. Comb.
- 2013

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

Is this relevant?

2013

2013

- Min Feng, Kaishun Wang
- 2013

A set of vertices W resolves a graph G if every vertex of G is uniquely determined by its vector of distances to the vertices in… (More)

Is this relevant?

2012

2012

Sierpiński graphs S p form an extensively studied family of graphs of fractal nature applicable in topology, mathematics of the… (More)

Is this relevant?

2012

2012

- S. Arumugam, Varughese Mathew
- Discrete Mathematics
- 2012

A vertex x in a connected graph G is said to resolve a pair {u, v} of vertices of G if the distance from u to x is not equal to… (More)

Is this relevant?

2011

2011

- Ioan Tomescu, Muhammad Imran
- Graphs and Combinatorics
- 2011

The R-set relative to a pair of distinct vertices of a connected graph G is the set of vertices whose distances to these vertices… (More)

Is this relevant?

2008

2008

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

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?

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?

2006