Identifying Codes on Directed De Bruijn Graphs

Debra Boutin, Victoria Horan Goliber, Mikko Pelto

For a directed graph $G$, a $t$-identifying code is a subset $S\subseteq V(G)$ with the property that for each vertex $v\in V(G)$ the set of vertices of $S$ reachable from $v$ by a…