Computing the metric dimension of a graph from primary subgraphs

Identificador:  imarina:5130633

Handle: https://hdl.handle.net/20.500.11797/imarina5130633

Autores:  Kuziak, Dorota; Rodriguez-Velazquez, Juan A; Yero, Ismael G

Resumen:
Let G be a connected graph. Given an ordered set W = {w1, . . . , wk} V (G) and a vertex u V (G), the representation of u with respect to W is the ordered k-tuple (d(u, w1), d(u, w2), . . . , d(u, wk)), where d(u, wi) denotes the distance between u and wi. The set W is a metric generator for G if every two different vertices of G have distinct representations. A minimum cardinality metric generator is called a metric basis of G and its cardinality is called the metric dimension of G. It is well known that the problem of finding the metric dimension of a graph is NP-hard. In this paper we obtain closed formulae for the metric dimension of graphs with cut vertices. The main results are applied to specific constructions including rooted product graphs, corona product graphs, block graphs and chains of graphs.