A note on watchman's walks in de Bruijn graphs
Combinatorics
2020-07-28 v1
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 is described by a de Bruijn sequence of order . This idea is extended to certain subdigraphs of de Bruijn graphs.
Cite
@article{arxiv.2007.12825,
title = {A note on watchman's walks in de Bruijn graphs},
author = {Danny Dyer and Jared Howell and Brittany Pittman},
journal= {arXiv preprint arXiv:2007.12825},
year = {2020}
}
Comments
7 pages, 3 figures