Computing Truncated Metric Dimension of Trees

Paul Gutkovich, Zi Song Yeoh

Let $G=(V,E)$ be a simple, unweighted, connected graph. Let $d(u,v)$ denote the distance between vertices $u,v$. A resolving set of $G$ is a subset $S$ of $V$ such that knowing the…