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.
2019
2019
Let G be a simple graph. A set of vertices, called V (G) and a set of edges, called E(G) are two sets which form graph G. W is a… 
2018
2018
The concept of metric dimension was proposed to model robot navigation where the places of navigating agents can change among… 
2017
2017
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
In this paper we study the metric dimension of the generalized Petersen graphs P (n, 3) by giving a partial answer to an open… 
2014
2014
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… 
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
For an ordered set W = {w1, w2, . . . , wk} of vertices and a vertex v in a connected graph G, the (metric) representation of v…