๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Isomorphic factorization of de Bruijn digraphs

โœ Scribed by Yukio Shibata; Toru Hasunuma; Sanae Fukuda

Book ID
108316428
Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
141 KB
Volume
218
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Generalized de Bruijn digraphs
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

Isomorphic factorization of the complete
Isomorphic factorization of the complete graph into Cayley digraphs
โœ G. L. Chia; Poh-Hwa Ong ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 151 KB

## Abstract Let __Z__~__p__~ denote the cyclic group of order __p__ where __p__ is a prime number. Let __X__ = __X__(__Z__~__p__~, __H__) denote the Cayley digraph of __Z__~__p__~ with respect to the symbol __H__. We obtain a necessary and sufficient condition on __H__ so that the complete graph on

Feedback numbers of de Bruijn digraphs
Feedback numbers of de Bruijn digraphs
โœ Xirong Xu; Yongchang Cao; Jun-Ming Xu; Yezhou Wu ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 586 KB

A subset of vertices of a graph G is called a feedback vertex set of G if its removal results in an acyclic subgraph. Let f (d, n) denote the minimum cardinality over all feedback vertex sets of the de Bruijn digraph B (d, n). This paper proves that for any integers d โ‰ฅ 2 and n โ‰ฅ 2 where i | n mean