LetG be a graph and e1, · · · , en be n distinct vertices. Let ρ be the metric onG. The code map on vertices, corresponding to this list, is c(x) = (ρ(x, e1), · · · , ρ(x, en)). This paper introduces a variation: begin with V ⊆ Z for some n, and consider assignments of edges E such that the identity function on V is a code map for G = (V,E). Refer to such a set E as a code-match. An earlier paper classified subsets of V for which at least one code-match exists. We prove • If there is a code-match E for which (V,E) is bipartite, than (V,E) is bipartite for every code-match E. • If there is a code-match E for which (V,E) is a tree, then E is unique. • There exists a code-match E such that (V,E) has a (2n−1 + 1)-vertex-coloring.
[1]
Gary Chartrand,et al.
Resolvability in graphs and the metric dimension of a graph
,
2000,
Discret. Appl. Math..
[2]
Kathryn Fraughnaugh,et al.
Introduction to graph theory
,
1973,
Mathematical Gazette.
[3]
David R. Wood,et al.
Extremal Graph Theory for Metric Dimension and Diameter
,
2007,
Electron. J. Comb..
[4]
Linda Eroh,et al.
The effect of vertex or edge deletion on the metric dimension of graphs
,
2015
.
[5]
P. Feit.
Classifying Resolving Lists by Distances between Members
,
2016
.