On Certain Resolving Parameters of Tree Derived Architectures

Let \( G = (V, E) \) be a graph. A set \( W \subset V \) of vertices **resolves** \( G \) if every vertex of \( G \) is uniquely determined by its vector of distances to the vertices in \( W \). The **metric dimension** of \( G \) is the minimum cardinality of a resolving set.

By imposing conditions on \( W \), we obtain **conditional resolving sets**.