Solid-Resolving Sets on Directed Graphs

Anni Hakanen, Pavan P D

A set $S\subseteq V(G)$ is a solid-resolving set of an undirected graph $G$ if each vertex can be distinguished from any vertex subset by their distances from the set $S$. Solid-r…