Abstract
We show that recursive circulant G(cdm, d) is hamiltonian decomposable. Recursive circulant is a graph proposed for an interconnection structure of multicomputer networks in [8]. The result is not only a partial answer to the problem posed by Alspach that every connected Cayley graph over an abelian group is hamiltonian decomposable, but also an extension of Micheneau’s that recursive circulant G(2m, 4) is hamiltonian decomposable.
This work was partially supported by the Catholic University of Korea under project no. 19980057.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
B. Alspach, “Unsolved problems 4.5,” Annals of Discrete Mathematics 27, p. 464, 1985.
J. A. Bondy and U. S. R. Murty, Graph Theory with Applications, 5th printing, American Elsevier Publishing Co., Inc., 1976.
J. Bosák, Decompositions of Graphs, Kluwer Academic Publishers, Dordrecht, Netherlands, 1990.
S. J. Curran and J. A. Gallian, “Hamiltonian cycles and paths in Cayley graphs and digraphs-a survey,” Discrete Mathematics 156, pp. 1–18, 1996.
C. C. Chen and N. F. Quimpo, “On strongly hamiltonian abelian group graphs,” Lecture Notes in Mathematics 884 (Springer, Berlin), Australian Conference on Combinatorial Mathematics, pp. 23–34, 1980.
J.-H. Lee, C.-S. Shin, and K.-Y. Chwa, “Directed hamiltonian packing in d- dimensional meshes and its applications,” in Proc. of 7th International Symposium on Algorithms and Computation ISAAC’96, Osaka, Japan, pp. 295–304, 1996.
C. Micheneau, “Disjoint hamiltonian cycles in recursive circulant graphs,” Information Processing Letters 61, pp. 259–264, 1997.
J.-H. Park and K.-Y. Chwa, “Recursive circulant: a new topology for multicomputer networks (extended abstract),” in Proc. of IEEE International Symposium on Parallel Architectures, Algorithms and Networks ISPAN’94, Kanazawa, Japan, pp. 73–80, Dec. 1994.
J.-H. Park and H.-C. Kim, “Hamiltonian decomposition of symmetric 3-regular digraphs,” in Proc. of 24th Korea Information Science Society Spring Conference, Chunchon, Korea, pp. 711–714, Apr. 1997 (written in Korean).
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
Park, JH. (1998). Hamiltonian Decomposition of Recursive Circulants. In: Chwa, KY., Ibarra, O.H. (eds) Algorithms and Computation. ISAAC 1998. Lecture Notes in Computer Science, vol 1533. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49381-6_32
Download citation
DOI: https://doi.org/10.1007/3-540-49381-6_32
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65385-1
Online ISBN: 978-3-540-49381-5
eBook Packages: Springer Book Archive