Routing in recursive circulant graphs: Edge forwarding index and hamiltonian decomposition

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1517, Issue , 1998, Pages 227-241

  Gauyacq, G ^a   Micheneau, C ^a   Raspaud, A ^a  

^a UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

HAMILTONIANS;

AS TOPOLOGIES; BISECTION WIDTH; CIRCULANT GRAPHS; FORWARDING INDEX; HYPERCUBE; MULTICOMPUTER NETWORK;

GRAPH THEORY;

EID: 84947907865     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10692760_19     Document Type: Conference Paper

References (14)

1. B. Alspach, Discrete Mathematics, problems, 50 (1984) pp. 115.
2. C. Berge, Graphs and Hypergraphs (North-Holland, Amsterdam, 2nd ed., 1976).
3. D. Barth and A. Raspaud, Two disjoint Hamiltonian cycles in the butterfly graph, Inf. Proc. Letters, 51 (1994) pp. 175-179.
4. J.C. Bermond, O. Favaron and M. Maheo, Hamiltonian decomposition of Cayley graphs of degree 4, J. Comb. Th. B, 46 (1989) pp. 142-153.
5. F.R.K. Chung, E.G. Coffman, M.I. Reiman, B. Simon, The forwarding index of communication Networks, IEEE Transactions on Information Theory 39 no2(1987), pp. 224-232
6. S.J. Curran, J. A. Gallian, Hamiltonian cycles and paths in Cayley graphs and digraphs, Discrete Math. 156, No.1-3,(1996) pp. 1-18.
7. G. Gauyacq, Routages uniformes dans les graphe sommet-transitifs, Phd Thesis (1995), LaBRI, Universite Bordeaux I, France.
8. M.C. Heydemann, J.C. Meyer, D. Sotteau, On forwarding indices of networks, Discrete Applied Maths 23 (1989) pp. 103-123
9. F.T. Leighton, Introduction to Parallel Algorithms and Architecture: arrays, trees, hypercubes, Morgan Kaufman Publisher, (1992).
10. J. Liu, Hamiltonian decompositions of Cayley graphs on abelian groups, Discrete Math., 131 (1994) pp. 163-171.
11. C. Micheneau, Disjoint Hamiltonian cycles in recursive circulant graphs, Inf. Proc. Letters, 61 (1997) pp. 259-264.
12. C. Micheneau, Graphes recursifs circulants, communication vagabondes et simulation, Phd Thesis (1996), LaBRI, Universite Bordeaux I, France.
13. Jung-Heum Park, Kyung-Yong Chwa, Recursive circulant: A new topology for multicomputer networks, Proc. Int. Int. Symp. Parallel Architectures, Algorithms and Networks ISPAN'94, Japan, IEEE (1994) 73-80.
14. J. de Rumeur, Communications dans les reseaux de processeurs, Masson (1994)