✦ LIBER ✦

On 2-extendable abelian Cayley graphs

✍ Scribed by Onn Chan; C.C. Chen; Qinglin Yu

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 737 KB
Volume: 146
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(94)00154-8

No coin nor oath required. For personal study only.

✦ Synopsis

A graph G is 2-extendable if any two independent edges of G are contained in a perfect matching of G. A Cayley graph of even order over an abelian group is 2-extendable if and only if it is not isomorphic to any of the following circulant graphs:

(I) Z2.(1,2n -1), n >~ 3; (II) ZE.(1,2,2n -1,2n -2), n >/3; (III) Z4.(1,4n -1,2n), n >~ 2; (IV) Z4.+2(2,4n,2n + l), n ~> 1; and (V) Z4.+2(l,4n + 1,2n,2n + 2), n >/ 1.

📜 SIMILAR VOLUMES

Hamilton cycle and Hamilton path extenda

Hamilton cycle and Hamilton path extendability of Cayley graphs on abelian groups

✍ Štefko MiklaviČ; Primož Šparl 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 198 KB

## Abstract In this paper the concepts of Hamilton cycle (HC) and Hamilton path (HP) extendability are introduced. A connected graph Γ is __n__‐__HC‐extendable__ if it contains a path of length __n__ and if every such path is contained in some Hamilton cycle of Γ. Similarly, Γ is __weakly n__‐__HP‐

Quasi-abelian cayley graphs and parsons

Quasi-abelian cayley graphs and parsons graphs

✍ Jun Wang; Ming-Yao Xu 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 304 KB

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 the Isomorphisms of Cayley Graphs of

On the Isomorphisms of Cayley Graphs of Abelian Groups

✍ Yan-Quan Feng; Yan-Pei Liu; Ming-Yao Xu 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 190 KB

Let G be a finite group, S a subset of G=f1g; and let Cay ðG; SÞ denote the Cayley digraph of G with respect to S: If, for any subset T of G=f1g; CayðG; SÞ ffi CayðG; T Þ implies that S a ¼ T for some a 2 AutðGÞ; then S is called a CI-subset. The group G is called a CIM-group if for any minimal gene

The hamilton spaces of cayley graphs on

The hamilton spaces of cayley graphs on abelian groups

✍ Brian Alspach; Stephen C. Locke; Dave Witte 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 759 KB

The Hamilton cycles of a graph generate a subspace of the cycle space called the Hamilton space. The Hamilton space of any connected Cayley graph on an abelian group is determined in this paper.

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