Maker-Breaker Strong Resolving Game

Cong X. Kang, Aleksander Kelenc, Eunjeong Yi

Let $G$ be a graph with vertex set $V$. A set $S\subseteq V$ is a \emph{strong resolving set} of $G$ if, for distinct $x,y\in V$, there exists $z\in S$ such that either $x$ lies o…