Computing the metric dimension of a graph from primary subgraphs release_hkd7ai7vs5fu3oa5rtzdbfzyli

by D. Kuziak, J. A. Rodríguez-Velázquez, I. G. Yero

Released as a article .

2015  

Abstract

Let G be a connected graph. Given an ordered set W = {w_1, w_2,... w_k}⊆ V(G) and a vertex u∈ V(G), the representation of u with respect to W is the ordered k-tuple (d(u,w_1), d(u,w_2),..., d(u,w_k)), where d(u,w_i) denotes the distance between u and w_i. 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.
In text/plain format

Archived Files and Locations

application/pdf  214.1 kB
file_jvc4tcec2jgthgvze3vefemkcq
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2015-02-10
Version   v2
Language   en ?
arXiv  1309.0641v2
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: e80eee84-e6a6-4cea-b7a7-64f9dc7ef9a4
API URL: JSON