Alspach has conjectured that any 2k-regular connected Cayley graph cay(A, S) on a finite abelian group A can be decomposed into k hamiltonian cycles. In this paper, the conjecture is shown to be true if S=[s 1 , s 2 , ..., s k ] is a minimal generating set of an abelian group A of odd order (where a
6-regular Cayley graphs on abelian groups of odd order are hamiltonian decomposable
โ Scribed by Erik E. Westlund; Jiuqiang Liu; Donald L. Kreher
- Book ID
- 118435545
- Publisher
- Elsevier Science
- Year
- 2009
- Tongue
- English
- Weight
- 545 KB
- Volume
- 309
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Alspach has conjectured that any 2k-regular connected Cayley graph cay(A,S) on a finite abelian group A can be decomposed into k hamiltonian cycles. In this paper, the conjecture is shown to be true if S= {sl,sz, s3} is a minimal generating set of A with 1 Al odd, or S={sl,s& . . . . sk} is a genera
In this paper it is shown that every connected Cayley graph of a semt-direct product of a cyclic group of prime order by an abelian group is hamiltonian. In particular, every connected Cayley graph of a group G is hamiltonian provided that G is of order greater than 2 and it contains a normal cyclic
Alspach has conjectured that any 2k-regular connected Cayley graph cay(A,S) on a finite abelian group A can be decomposed into k hamiltonian cycles. In this paper we generalize a result by Kotzig that the Cartesian product of any two cycles can be decomposed into two hamiltonian cycles and show that