Theory and Applications of Graphs Theory and Applications of Graphs

Abstract

Let G be a connected graph and let w 1 , · · · w r be a list of vertices. We refer to the choice of a triple ( r ; G ; w 1 , · · · w r ), as a metric selection. Let ρ be the shortest path metric of G . We say that w 1 , · · · w r resolves G (metricly) if the function c : V ( G ) −→ Z r given by