A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Computing the metric dimension of a graph from primary subgraphs
[article]
2015
arXiv
pre-print
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
arXiv:1309.0641v2
fatcat:hkd7ai7vs5fu3oa5rtzdbfzyli