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
2017
Discussiones Mathematicae Graph Theory
Let G be a connected graph. Given an ordered set W = {w 1 , . . . , 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
doi:10.7151/dmgt.1934
fatcat:stdljdw5qrd7xnjsl3by4rowy4