✦ LIBER ✦

Generalized de Bruijn graphs

✍ Scribed by F. M. Malyshev; V. E. Tarakanov

Publisher: SP MAIK Nauka/Interperiodica
Year: 1997
Tongue: English
Weight: 606 KB
Volume: 62
Category: Article
ISSN: 0001-4346
DOI: 10.1007/bf02358978

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Counting closed walks in generalized de

Counting closed walks in generalized de Bruijn graphs

✍ Yukio Shibata; Miyuki Shirahata; Shingo Osawa 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 313 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 Cycles

✍ Joshua N. Cooper; Ronald L. Graham 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 229 KB

2-diameter of de Bruijn graphs

✍ Li, Qiao; Sotteau, Dominique; Xu, Junming 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 589 KB

This paper shows that in the undirected binary de Bruijn graph of dimension n . UB(n), which has diameter n , there exist at least two internally vertex disjoint paths of length at most n between any two vertices. In other words, the 2-diameter of U B ( n ) is equal to its diameter n .

Bisecting de Bruijn and Kautz graphs

✍ José Rolim; Pavel Tvrdik; Jan Trdlička; Imrich Vrto 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 675 KB

De Bruijn and Kautz graphs have been intensively studied as perspective interconnection networks of massively parallel computers. One of the crucial parameters of an interconnection network is its bisection width. It has an influence on both communication properties of the network and the algorithmi

Wide diameters of de Bruijn graphs

✍ Jyhmin Kuo; Hung-Lin Fu 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 288 KB