You're viewing this item in the new Europeana website. View this item in the original Europeana.

Resolving domination in graphs

For an ordered set W = {w1, w2, . . . , wk} of vertices and a vertex v in a connected graph G, the (metric) representation of v with respect to W is the k-vector r(v|W) = (d(v, w1), d(v, w2), . . . , d(v, wk)), where d(x, y) represents the distance between the vertices x and y. The set W is a resolving set for G if distinct vertices of G have distinct representations with respect to W. A resolving…