𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Isomorphisms of Cayley graphs of a free Abelian group

✍ Scribed by A. A. Ryabchenko

Publisher
SP MAIK Nauka/Interperiodica
Year
2007
Tongue
English
Weight
113 KB
Volume
48
Category
Article
ISSN
0037-4466

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Isomorphisms of Cayley graphs. II
Isomorphisms of Cayley graphs. II
✍ L. Babai; P. Frankl πŸ“‚ Article πŸ“… 1979 πŸ› Akadmiai Kiad 🌐 English βš– 439 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 Isomorphisms of Finite Cayley Graphs
On Isomorphisms of Finite Cayley Graphs
✍ M. Conder; C. Heng Li πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 148 KB

A Cayley graph Cay(G, S) of a group G is called a CI-graph if whenever T is another subset of G for which Cay(G, S) ∼ = Cay(G, T ), there exists an automorphism Οƒ of G such that S Οƒ = T . For a positive integer m, the group G is said to have the m-CI property if all Cayley graphs of G of valency m a

On isomorphisms of connected Cayley grap
On isomorphisms of connected Cayley graphs
✍ Li Cai Heng πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 696 KB

Let G be a finite group and Cay(G,S) the Cayley graph of G with respect to S. A subset S is called a CI-subset if, for any TCG, Cay(G,S) ~ Cay(G,T) implies S ~ = T for some ct E Aut(G). In this paper, we investigate the finite groups G in which every subset S with size at most m and (S) = G is a CI-