On the strong metric dimension of composed graphs

Marcel Wagner, Yannick Schmitz, Egon Wanke

Two vertices $u$ and $v$ of an undirected graph $G$ are strongly resolved by a vertex $w$ if there is a shortest path between $w$ and $u$ containing $v$ or a shortest path between…