Abstract
The recursive circulant graphs G(2m,4) were described in [13] as a concurrent to the hypercube considered as topology for multicomputer networks. In this paper we give the exact value of the edge forwarding index and bisection width of the generalize recursive circulant graphs G(cd m,d) with d > c > 0. Moreover we prove that they admit a Hamiltonian decomposition.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alspach, B.: Discrete Mathematics. Problems 50, 115 (1984)
Berge, C.: Graphs and Hypergraphs, 2nd edn. North-Holland, Amsterdam (1976)
Barth, D., Raspaud, A.: Two disjoint Hamiltonian cycles in the butterfly graph. Inf. Proc. Letters 51, 175–179 (1994)
Bermond, J.C., Favaron, O., Maheo, M.: Hamiltonian decomposition of Cayley graphs of degree 4. J. Comb. Th. B 46, 142–153 (1989)
Chung, F.R.K., Coffman, E.G., Reiman, M.I., Simon, B.: The forwarding index of communication Networks. IEEE Transactions on Information Theory 39(2), 224–232 (1987)
Curran, S.J., Gallian, J.A.: Hamiltonian cycles and paths in Cayley graphs and digraphs. Discrete Math. 156(1-3), 1–18 (1996)
Gauyacq, G.: Routages uniformes dans les graphe sommet-transitifs, Phd Thesis, LaBRI, Université Bordeaux I, France (1995)
Heydemann, M.C., Meyer, J.C., Sotteau, D.: On forwarding indices of networks. Discrete Applied Maths 23, 103–123 (1989)
Leighton, F.T.: Introduction to Parallel Algorithms and Architecture: arrays, trees, hypercubes. Morgan Kaufman Publisher, San Francisco (1992)
Liu, J.: Hamiltonian decompositions of Cayley graphs on abelian groups. Discrete Math. 131, 163–171 (1994)
Micheneau, C.: Disjoint Hamiltonian cycles in recursive circulant graphs. Inf. Proc. Letters 61, 259–264 (1997)
Micheneau, C.: Graphes récursifs circulants, communication vagabondes et simulation, Phd Thesis, LaBRI, Université Bordeaux I, France (1996)
Park, J.-H., Chwa, K.-Y.: Recursive circulant: A new topology for multicomputer networks. In: Proc. Int. Symp. Parallel Architectures, Algorithms and Networks ISPAN 1994, Japan, pp. 73–80. IEEE, Los Alamitos (1994)
de Rumeur, J.: Communications dans les reseaux de processeurs. Masson (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gauyacq, G., Micheneau, C., Raspaud, A. (1998). Routing in Recursive Circulant Graphs: Edge Forwarding Index and Hamiltonian Decomposition. In: Hromkovič, J., Sýkora, O. (eds) Graph-Theoretic Concepts in Computer Science. WG 1998. Lecture Notes in Computer Science, vol 1517. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10692760_19
Download citation
DOI: https://doi.org/10.1007/10692760_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65195-6
Online ISBN: 978-3-540-49494-2
eBook Packages: Springer Book Archive