Conditional resolvability in graphs: a survey (Q1777664)

Summary: For an ordered set \(W=\{w_1, w_2, \dotsc, w_k\}\) of vertices and a vertex \(v\) in a connected graph \(G\), the code of \(v\) with respect to \(W\) is the \(k\)-vector \(c_W(v) = (d(v, w_1), \dots, d(v, w_k))\), 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 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 the 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.