A note on watchman's walks in de Bruijn graphs

Abstract

The watchman's walk problem in a digraph calls for finding a minimum length closed dominating walk, where direction of arcs is respected. The watchman's walk of a de Bruijn graph of order $k$ is described by a de Bruijn sequence of order $k-1$. This idea is extended to certain subdigraphs of de Bruijn graphs.

7 pages, 3 figures

References in corpus (1)

• The watchman's walk problem on directed graphs

Cited by in corpus (1)

• The watchman's walk problem on directed graphs