The Threshold Strong Dimension of a Graph

Nadia Benakli, Novi H Bong, Shonda M. Dueck +3

Let $G$ be a connected graph and $u,v$ and $w$ vertices of $G$. Then $w$ is said to {\em strongly resolve} $u$ and $v$, if there is either a shortest $u$-$w$ path that contains $v$…