Hamilton circuits in the directed wrapped Butterfly network

Discrete Applied Mathematics

Volumn 84, Issue 1-3, 1998, Pages 21-42

  Bermond, J C ^a   Darrot, E ^a   Delmas, O ^a   Perennes, S ^a  

^a INRIA   (France)

Author keywords

Butterfly digraph; Graph theory; Hamilton circuit; Hamilton cycle; Hamilton decomposition; Perfect matching

Indexed keywords

EID: 0003110727     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(97)00095-4     Document Type: Article

References (17)

1. B. Alspach, Research problem 59, Discrete Math. 50 (1984) 115.
2. B. Alspach, J-C. Bermond, D. Sotteau, Decomposition into cycles I: Hamilton decompositions, in: G. Hahn et al. (Eds.), Cycles and Rays, Proc. Colloq. Montréal, 1987, NATO ASI Ser. C, Kluwer, Dordrecht, 1990, pp. 9-18.
3. J. Aubert, B. Schneider, Décomposition de la somme cartésienne d'un cycle et de l'union de deux cycles en cycles hamiltoniens, Discrete Math. 38 (1982) 7-16.
4. R. Balakrishnan, J.C. Bermond, P. Paulraja, On the decomposition of de Bruijn graphs into hamiltonian cycles, manuscript.
5. D. Barth, Réseaux d'interconnection: structures et communications, Ph.D. thesis, Université de Bordeaux I, 1994.
6. n**, Discrete Appl. Math. 56 (1995) 127-136.
7. D. Barth, A. Raspaud, Two edge-disjoint hamiltonian cycles in the Butterfly graph, Inform. Process. Lett. 51 (1994) 175-179.
8. J-C. Bermond, E. Darrot, O. Delmas, S. Perennes, Hamilton cycle decomposition of the Butterfly network, Technical Report RR-2920, Inria - Sophia Antipolis - Projet SLOOP (CNRS/INRIA/UNSA), June 1996. Parallel Processing Letters (to appear).
9. J-C. Bermond, O. Favaron, M. Maheo, Hamiltonian decomposition of Cayley graphs of degree 4, J. Combin. Theory Ser. B 46(2) (1989) 142-153.
10. J-C. Bermond, C. Peyrat, Broadcasting in de Bruijn networks, in: Proc. 19th S-E Conf. Combinat., Congr. Numer. 66, Graph theory, and Computing, Florida, 1988, pp. 283-292.
11. S.J. Curran, J.A. Gallian, Hamilton cycles and paths in Cayley graphs and digraphs - a survey, Discrete Math, (to appear).
12. H. Fleischner, B. Jackson, Compatible euler tours in eulerian digraphs, in: G. Hahn et al. (Eds.), Cycles and Rays, Proc. Colloq. Montréal, 1987, NATO ASI Ser. C, Kluwer, Dordrecht, 1990, pp. 95-100.
13. F.T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays . Trees . Hypercubes, Computer Science, Mathematics Electrical Engineering, Morgan Kaufmann, Los Altos, CA, 1992.
14. R. Rowley, B. Bose, On the number of arc-disjoint hamiltonian circuits in the de Bruijn graph, Parallel Process. Lett. 3 (1993) 375-380.
15. Jean de Rumeur, Communication dans les réseaux de processeurs, Collection Etudes et Recherches en Informatique, Masson, 1994, (English version to appear).
16. M. Syska, Communications dans les architectures à mémoire distribuée, Ph.D. thesis, Université de Nice Sophia Antipolis, 1992.
17. 2m,2m≥8, J. Combin. Theory Ser. B 29 (1980) 68-74.