Constructing Higher-Order De Bruijn Graphs

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 2002
Accession Number
ADA404934

Entities

People

  • D'hania J. Hunt

Organizations

  • Naval Postgraduate School

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Applied Mathematics
  • California
  • Computer Programming
  • Computer Programs
  • Computers
  • Literature Surveys
  • Mathematics
  • New York
  • Schools
  • Sequences
  • Shift Registers
  • Software Development
  • Theses
  • United States
  • United States Military Academy

Fields of Study

  • Mathematics

Readers

  • Graph Algorithms and Convex Optimization.
  • Small Business Innovation Research Program (SBIR) EDI Research and Innovation.
  • Systems Analysis and Design