Resolving dominating partitions in graphs

Carmen Hernando, Mercè Mora, Ignacio M. Pelayo

A partition $\Pi =\{S_1,\dots ,S_k\}$ of the vertex set of a connected graph $G$ is called a \emph{resolving partition} of $G$ if for every pair of vertices $u$ and $v$, $d(u,S_j)\neq…