Professor of Mathematics Debra Boutin recently published a research article "Identifying Codes on Directed de Bruijn Graphs" with co-authors Victoria Horan and Mikko Pelto, in the journal Discrete Applied Mathematics.
The de Bruijn graphs have nodes associated with binary strings of fixed length with particularly nice paths between them. In this work, the authors investigate various ways of uniquely identifying nodes of a de Bruijn graph by their relationships to other nodes in the graph. This work both extends what is known about de Bruijn graphs and broadens the set of graphs for which various types of identifying properties hold.
