In this paper, we count small cycles in generalized de Bruijn digraphs. Let n Γ pd h , where d Γ / p, and g l Γ gcd(d l 0 1, n). We show that if p Γ΅ d 3 and k Β°ο£°log d nο£» / 1, or p ΓΊ d 3 and k Β°h / 3, then the number of cycles of length k in a generalized de Bruijn digraph G B (n, d) is given by 1/ k
β¦ LIBER β¦
Generalized de Bruijn Cycles
β Scribed by Joshua N. Cooper; Ronald L. Graham
- Publisher
- Springer
- Year
- 2004
- Tongue
- English
- Weight
- 229 KB
- Volume
- 8
- Category
- Article
- ISSN
- 0218-0006
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Counting small cycles in generalized de
β
Hasunuma, Toru; Shibata, Yukio
π
Article
π
1997
π
John Wiley and Sons
π
English
β 143 KB
Generalized de Bruijn digraphs
β
D. Z. Du; F. K. Hwang
π
Article
π
1988
π
John Wiley and Sons
π
English
β 566 KB
We show that the digraphs proposed independently by lmase and Itoh, and Reddy, Radhan and Kuhl to minimize diameters essentially retain all the nice properties of de Bruijn digraphs and yet are applicable to any number of nodes. In particular we give results on the number of loops, the link connecti
Generalized de Bruijn graphs
β
F. M. Malyshev; V. E. Tarakanov
π
Article
π
1997
π
SP MAIK Nauka/Interperiodica
π
English
β 606 KB
Counting closed walks in generalized de
β
Yukio Shibata; Miyuki Shirahata; Shingo Osawa
π
Article
π
1994
π
Elsevier Science
π
English
β 313 KB
The Hamiltonian property of generalized
β
D.Z Du; D.F Hsu; F.K Hwang; X.M Zhang
π
Article
π
1991
π
Elsevier Science
π
English
β 512 KB
Generation of some de Bruijn sequences
β
Man-Keung Siu; Po Tong
π
Article
π
1980
π
Elsevier Science
π
English
β 411 KB
The cycle structure of the "connection" of feedback logics is applied to construct more polynomials which generate de Bruijn sequences.