✦ LIBER ✦

Connected Cayley graphs of semi-direct products of cyclic groups of prime order by abelian groups are hamiltonian

✍ Scribed by Erich Durnberger

Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 705 KB
Volume: 46
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(83)90270-4

No coin nor oath required. For personal study only.

✦ Synopsis

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 subgroup N of prime order such that the quotient group G/N is abelian and its order is relauvely prime to that of N

📜 SIMILAR VOLUMES

Hamiltonian Decompositions of Cayley Gra

Hamiltonian Decompositions of Cayley Graphs on Abelian Groups of Odd Order

✍ Jiuqiang Liu 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 380 KB

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

Pseudo-cartesian product and hamiltonian

Pseudo-cartesian product and hamiltonian decompositions of Cayley graphs on abelian groups

✍ Cong Fan; Don R. Lick; Jiuqiang Liu 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 971 KB

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