Closed formulae for the strong metric dimension of lexicographic product graphs

Dorota Kuziak, Ismael G. Yero, Juan A. Rodriguez-Velazquez

Given a connected graph $G$, a vertex $w\in V(G)$ strongly resolves two vertices $u,v\in V(G)$ if there exists some shortest $u-w$ path containing $v$ or some shortest $v-w$ path c…