Constructing higher-order de Bruijn graphs
Loading...
Authors
Hunt, D'Hania J.
Subjects
Advisors
Fredricksen, Harold
Date of Issue
2002-06
Date
Publisher
Monterey, California. Naval Postgraduate School
Language
Abstract
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.
Type
Thesis
Description
Series/Report No
Department
Applied Mathematics
Organization
Identifiers
NPS Report Number
Sponsors
Funder
Format
xii, 47 p. : ill. (some col.)
Citation
Distribution Statement
Approved for public release; distribution is unlimited.
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.