By Debra Boutin and others

For a directed graph *G*, a {\it *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 directed path of length at most *t* is both non-empty and unique. A graph is called... Show more

August 26, 2015

Loading full text...

Similar articles

Loading recommendations...

x1

Identifying Codes on Directed De Bruijn Graphs

Click on play to start listening