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
On the Normality of Cayley Digraphs of Valency 2 on Non-Abelian Group of Odd Order
โ Scribed by Ping Wang; Jiong-Sheng Li
- Publisher
- Springer
- Year
- 2000
- Weight
- 58 KB
- Volume
- 24
- Category
- Article
- ISSN
- 0129-2021
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Let G be finite group and let S be a subset of G. We prove a necessary and sufficient condition for the Cayley digraph Xc~,s) to be primitive when S contains the central elements of G. As an immediate consequence we obtain that a Cayley digraph X 1, (6 S) on an Abelian group is primitive if and only
We construct a degree 32 Cayley graph whose automorphism group contains two nonconjugate regular subgroups isomorphic to Z$
Given any prime p, there are two non-isomorphic groups of order p2. We determine precisely when a Cayley digraph on one of these groups is isomorphic to a Cayley digraph on the other group, Namely, let X = Cay(G: T) be a Cayley digraph on a group G of order p2 with generating set T. We prove that X