Abstract
We give a necessary and sufficient condition for 2-generated Cayley digraphs of abelian groups to be hamiltonian or to be hamiltonian decomposable. As applications, we derive the counting formula for the number of the hamiltonian cycles in the. conjunction of an undirected cycle and a directed cycle and that in the cartesian product of two directed cycles.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Y.H.Xu, Double loop networks with minimum delay, Jour Discrete Math. 66(1987), 109–118.
D.Witte and J.A.Gallian, A survey: Hamiltonian cycles in Cayley graphs, Discrete Math. 5(1984),283–304.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Meng, J. (1995). Hamiltonian cycles in 2-generated Cayley digraphs of abelian groups. In: Du, DZ., Li, M. (eds) Computing and Combinatorics. COCOON 1995. Lecture Notes in Computer Science, vol 959. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030855
Download citation
DOI: https://doi.org/10.1007/BFb0030855
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60216-3
Online ISBN: 978-3-540-44733-7
eBook Packages: Springer Book Archive