✦ LIBER ✦

On edge-Hamiltonian property of Cayley graphs

✍ Scribed by C.C. Chen

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 368 KB
Volume: 72
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(88)90191-4

No coin nor oath required. For personal study only.

✦ Synopsis

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 even order, it can be shown that G(X) is Hamiltonian iff it is edge-Hamiltonian. Hence every Cayley graph of order a power of 2 is edge-Hamiltonian.

📜 SIMILAR VOLUMES

Edge-hamiltonian property in regular 2-

Edge-hamiltonian property in regular 2- connected graphs

✍ Hao Li 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 515 KB

Bill Jackson has proved that every 2-connected, k-regular graph on at most 3k vertices is hamiltonian. It is shown in this paper that, under almost the same conditions as above, the graphs are edge-hamiltonian.

Hamilton-Connected Cayley Graphs on Hami

Hamilton-Connected Cayley Graphs on Hamiltonian Groups

✍ Brian Alspach; Yusheng Qin 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 109 KB

It is proven that every connected Cayley graph X , of valency at least three, on a Hamiltonian group is either Hamilton laceable when X is bipartite, or Hamilton connected when X is not bipartite.

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

On Hamiltonian cycles in Cayley graphs o

On Hamiltonian cycles in Cayley graphs of wreath products

✍ Richard Stong 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 314 KB

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

The edge reconstruction of hamiltonian g

The edge reconstruction of hamiltonian graphs

✍ L. Pyber 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 305 KB 👁 1 views

## Abstract If a graph __G__ on __n__ vertices contains a Hamiltonian path, then __G__ is reconstructible from its edge‐deleted subgraphs for __n__ sufficiently large.