<div class="description">
<p>We construct binary de Bruijn graphs of odd order using recursive generation. We also explore the properties and nuances of these particular graphs. The recursive method developed for this thesis could in principle be used for other de Bruijn graphs of a different order. Suggestions on how this is accomplished are included in the paper and areas of further research topics.
</p>
<br>Subjects: Graph theory; Recursion theory</div>
<div class="fn value">
Hunt, D'Hania J.</div>
Internet Archive identifier