The goal of this paper is to introduce De Bruijn graphs and discuss their various applications. We will begin by examining N.G. de Bruijn's original paper and the proof of his claim that there are exactly 22^(n-1)-n De Bruijn cycles in the binary De Bruijn graph B(2, n). In order to study this we explore the properties of Hamiltonian and Eulerian cycles that occur on De Bruijn graphs and the type of redundancy that occurs as a result. Lastly, in this paper we seek to provide some guidance into further research on De Bruijn graphs and their potential applications to other areas
Abstract. We give two equivalent formulations of a conjecture [2,4] on the number of arc-disjoint Ha...
We describe an algorithm for determining a nonlinear de Bruijn sequence of length 2n requiring only ...
AbstractIn this paper, it is proved that for every positive odd integer n, there exists a Hamiltonia...
The purpose of this thesis is to examine the number of edge-disjoint Hamiltonian cycles in de Bruijn...
The purpose of this thesis is to examine the number of edge-disjoint Hamiltonian cycles in de Bruijn...
AbstractThe Good-de Bruijn graph was originally defined to settle a question of existence of a certa...
A de Bruijn sequence of order n is a binary string of length 2n which, when viewed cyclically, conta...
A cycle is a sequence taken in a circular order—that is, follows, and are all the same cycle as. Giv...
A binary modified de Bruijn sequence is an infinite and periodic binary sequence derived by removing...
AbstractAn algebraic approach to enumerate the number of cycles of short length in the de Bruijn-Goo...
A de Bruijn sequence over a finite alphabet of span n is a cyclic string such that all words of leng...
AbstractDe Bruijn cycles are cyclic binary strings of length n where all substrings of length i are ...
AbstractGolomb has conjectured that the number of cycles generated by an arbitrary binary recurrence...
We show that the problem of finding the family of all so called the locally reducible factors in the...
We show that the problem of finding the family of all so called the locally reducible factors in the...
Abstract. We give two equivalent formulations of a conjecture [2,4] on the number of arc-disjoint Ha...
We describe an algorithm for determining a nonlinear de Bruijn sequence of length 2n requiring only ...
AbstractIn this paper, it is proved that for every positive odd integer n, there exists a Hamiltonia...
The purpose of this thesis is to examine the number of edge-disjoint Hamiltonian cycles in de Bruijn...
The purpose of this thesis is to examine the number of edge-disjoint Hamiltonian cycles in de Bruijn...
AbstractThe Good-de Bruijn graph was originally defined to settle a question of existence of a certa...
A de Bruijn sequence of order n is a binary string of length 2n which, when viewed cyclically, conta...
A cycle is a sequence taken in a circular order—that is, follows, and are all the same cycle as. Giv...
A binary modified de Bruijn sequence is an infinite and periodic binary sequence derived by removing...
AbstractAn algebraic approach to enumerate the number of cycles of short length in the de Bruijn-Goo...
A de Bruijn sequence over a finite alphabet of span n is a cyclic string such that all words of leng...
AbstractDe Bruijn cycles are cyclic binary strings of length n where all substrings of length i are ...
AbstractGolomb has conjectured that the number of cycles generated by an arbitrary binary recurrence...
We show that the problem of finding the family of all so called the locally reducible factors in the...
We show that the problem of finding the family of all so called the locally reducible factors in the...
Abstract. We give two equivalent formulations of a conjecture [2,4] on the number of arc-disjoint Ha...
We describe an algorithm for determining a nonlinear de Bruijn sequence of length 2n requiring only ...
AbstractIn this paper, it is proved that for every positive odd integer n, there exists a Hamiltonia...