Conditional resolvability in graphs: a survey

For an ordered setW = {w1,w2, . . . ,wk} of vertices and a vertexv in a connected graphG, the code of v with respect toW is the k-vector cW (v)= (d(v,w1),d(v,w2), . . . ,d(v,wk)), where d(x,y) represents the distance between the vertices x andy . The setW is a resolving set for G if distinct vertices of G have distinct codes with respect to W . The minimum cardinality of a resolving set for G is its dimension dim(G). Many resolving parameters are formed by extending resolving sets to different subjects in graph theory, such as the partition of the vertex set, decomposition, and coloring in graphs, or by combining resolving property with another graph-theoretic property such as being connected, independent, or acyclic. In this paper, we survey results and open questions on the resolving parameters defined by imposing an additional constraint on resolving sets, resolving partitions, or resolving decompositions in graphs.