Graphs where every k-subset of vertices is an identifying set

Sylvain Gravier, Svante Janson, Tero Laihonen +1

Let $G=(V,E)$ be an undirected graph without loops and multiple edges. A subset $C\subseteq V$ is called \emph{identifying} if for every vertex $x\in V$ the intersection of $C$ and…