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 local metric dimension of a graph from the local metric dimension of primary subgraphs
[article]

2014
*
arXiv
*
pre-print

For an ordered subset W = {w_1, w_2,... w_k} of vertices and a vertex u in a connected graph G, the representation of u with respect to W is the ordered k-tuple r(u|W)=(d(v,w_1), d(v,w_2),..., d(v,w_k)), where d(x,y) represents the distance between the vertices x and y. The set W is a local metric generator for G if every two adjacent vertices of G have distinct representations. A minimum local metric generator is called a local metric basis for G and its cardinality the local metric dimension

arXiv:1402.0177v1
fatcat:gvfcpnkb6fgi5apsgpejxana3u