✦ LIBER ✦

Hamiltonian decomposition of Cayley graphs of degree 4

✍ Scribed by J.-C Bermond; O Favaron; M Maheo

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 592 KB
Volume: 46
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(89)90040-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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

On edge-Hamiltonian property of Cayley g

On edge-Hamiltonian property of Cayley graphs

✍ C.C. Chen 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 368 KB

Let G be a group generated by X. A Cayley graph ouer G is defined as a graph G(X) whose vertex set is G and whose edge set consists of all unordered pairs [a, b] with a, b E G and am'b E X U X-', where X-t denotes the set (x-t ( .x E X}. When X is a minimal generating set or each element of X is of

Large Cayley graphs and vertex-transitiv

Large Cayley graphs and vertex-transitive non-Cayley graphs of given degree and diameter

✍ Heather Macbeth; Jana Šiagiová; Jozef Širáň; Tomáš Vetrík 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 128 KB

## Abstract For any __d__⩾5 and __k__⩾3 we construct a family of Cayley graphs of degree __d__, diameter __k__, and order at least __k__((__d__−3)/3)^__k__^. By comparison with other available results in this area we show that our family gives the largest currently known Cayley graphs for a wide ra

Hyper hamiltonian laceability of Cayley

Hyper hamiltonian laceability of Cayley graphs generated by transpositions

✍ Toru Araki 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB