𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Circuits in cayley digraphs of finite abelian groups

✍ Scribed by Anne Marie Wilkinson

Publisher
John Wiley and Sons
Year
1990
Tongue
English
Weight
290 KB
Volume
14
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

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.

πŸ“œ SIMILAR VOLUMES

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

Isomorphisms of Finite Cayley Digraphs o
Isomorphisms of Finite Cayley Digraphs of Bounded Valency
✍ Cai Heng Li; Cheryl E. Praeger; Ming Yao Xu πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 377 KB

Let G be a finite group, S a subset of G" [1], and let Cay(G, S ) denote the Cayley digraph of G with respect to S. If, for all subsets S, T of G"[1] of size at most m, Cay(G, S )$Cay(G, T) implies that S \_ =T for some \_ # Aut(G), then G is called an m-DCI-group. In this paper, we prove that, for

Isomorphisms of Finite Cayley Digraphs o
Isomorphisms of Finite Cayley Digraphs of Bounded Valency, II
✍ Cai Heng Li πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 152 KB

For a finite group G and a subset S of G which does not contain the identity of G, denote by Cay(G, S) the Cayley digraph of G with respect to S. An automorphism \_ of the group G induces a graph isomorphism from Cay(G, S) to Cay(G, S \_ ). In this paper, we investigate groups G and Cayley digraphs

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

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