Factorization of de bruijn digraphs by cycle-rooted trees

Information Processing Letters

Volumn 77, Issue 5-6, 2001, Pages 269-275

  Kawai, Hiroyuki ^a   Fujikake, Naohiro ^a   Shibata, Yukio ^a  

^a GUNMA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; PROBLEM SOLVING;

CYCLE-ROOTED TREES; DE BRUIJN DIGRAPHS;

TREES (MATHEMATICS);

EID: 0035277508     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(00)00157-5     Document Type: Article

References (11)

1. Annexstein F., Baumslag M., Rosenberg A.L. Group action graphs and parallel architectures. SIAM J. Comput. 19:1990;544-569.
2. Bermond J.C., Fraigniaud P. Broadcasting and gossiping in de Bruijn networks. SIAM J. Comput. 23:1994;212-225.
3. Bermond J.C., Hell P. On even factorizations and the chromatic index of the Kautz and de Bruijn digraphs. J. Graph Theory. 17:1993;647-655.
4. Bermond J.C., Peyrat C. De Bruijn and Kautz networks: A competitor for the hypercube? Hypercube and Distributed Computers. 1989;279-293 North-Holland, Amsterdam.
5. Cameron P.J. Combinatorics: Topics, Techniques, Algorithms. 1994;Cambridge University Press.
6. Espona M., Serra O. Cayley digraphs based on the de Bruijn networks. SIAM J. Discrete Math. 11:1998;305-317.
7. Fiol M.A., Serra O. Arc-colored line digraphs and their groups. Alavi Y., et al. Graph Theory, Combinatorics, Algorithms, and Applications Proc. Appl. Math. 54:1991;459-468 SIAM, Philadelphia, PA.
8. Hasunuma T., Shibata Y. Isomorphic decompositions and arc-disjoint spanning trees of Kautz digraphs. IPSJ SIG Notes, 96-AL-51:1996;. pp. 63-70.
9. Hasunuma T. Completely independent spanning trees in the underlying graph of a line digraph. IPSJ SIG Notes, 8000-AL-71:2000;. pp. 41-48.
10. Imase M., Soneoka T., Okada K. Connectivity of regular directed graphs with small diameters. IEEE Trans. Comput. C-34:1985;267-273.
11. Wallis W.D. One-Factorizations. 1997;Kluwer Academic Publishers, Dordrecht.