✦ LIBER ✦

Hamiltonian cycles and decompositions of cayley digraphs of finite abelian groups

✍ Scribed by Meng Jixiang; Huang Qiongxiang

Book ID: 107502073
Publisher: SP Editorial Committee of Applied Mathematics - A Journal of Chinese Universities
Year: 1997
Tongue: English
Weight: 319 KB
Volume: 12
Category: Article
ISSN: 1005-1031
DOI: 10.1007/s11766-997-0027-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hamiltonian paths in Cayley digraphs of

Hamiltonian paths in Cayley digraphs of finitely-generated infinite abelian groups

✍ Douglas Jungreis 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 983 KB

We show every finitely-generated, infinite abeliar\_ group (i.e. Zn x G where G is a finite abelian group) has a minimal generating set for which the Cayley digraph has a two-way in&rite hamiltonian path, and if n 2 2, then this Cayley digraph also has a one-way infinite hamiltonian path. We show fu

Hamiltonian decompositions of Cayley gra

Hamiltonian decompositions of Cayley graphs on Abelian groups

✍ Jiuqiang Liu 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 606 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= {sl,sz, s3} is a minimal generating set of A with 1 Al odd, or S={sl,s& . . . . sk} is a genera

Circuits in cayley digraphs of finite ab

Circuits in cayley digraphs of finite abelian groups

✍ Anne Marie Wilkinson 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 290 KB

## Abstract We find all possible lengths of circuits in Cayley digraphs of two‐generated abelian groups over the two‐element generating sets and over certain three‐element generating sets.

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

Normal Minimal Cayley Digraphs of Abelia

Normal Minimal Cayley Digraphs of Abelian Groups

✍ Jixiang Meng; Bao Ying 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 60 KB

A Cayley digraph X = Cay(G, S) is said to be normal for G if the regular representation R(G) of G is normal in the full automorphism group Aut(X ) of X . A characterization of normal minimal Cayley digraphs for abelian groups is given. In addition, the abelian groups, all of whose minimal Cayley dig