✦ LIBER ✦

Hypercubes, shuffle-exchange graphs and de Bruijn digraphs

✍ Scribed by Niall Graham; Frank Harary

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 438 KB
Volume: 17
Category: Article
ISSN: 0895-7177
DOI: 10.1016/0895-7177(93)90255-w

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Embeddings of Hypercubes and Grids into

Embeddings of Hypercubes and Grids into de Bruijn Graphs

✍ M.C. Heydemann; J. Opatrny; D. Sotteau 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 644 KB

An embedding of a graph \(G\) into a graph \(H\) is an injective mapping \(f\) from the vertices of \(G\) into the vertices of \(H\) together with a mapping \(P_{f}\) of edges of \(G\) into paths in \(H\). The dilation of the embedding is the maximum taken over all the lengths of the paths \(P_{f}(x

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

Hypercube and shuffle-exchange algorithm

Hypercube and shuffle-exchange algorithms for image component labeling

✍ R Cypher; J.L.C Sanz; L Snyder 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 704 KB

On the domination numbers of generalized

On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs

✍ Yosuke Kikuchi; Yukio Shibata 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 94 KB

This work deals with the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs. Dominating sets for digraphs are not familiar compared with dominating sets for undirected graphs. Whereas dominating sets for digraphs have more applications than those for undirected graph

Spanners of de Bruijn and Kautz graphs

✍ Rabah Harbane; Carles Padró 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 530 KB

Counting small cycles in generalized de

Counting small cycles in generalized de Bruijn digraphs

✍ Hasunuma, Toru; Shibata, Yukio 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 143 KB

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