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 multigraphs of degree 4 on finite abelian groups
✍ Scribed by C. Delorme; O. Favaron; M. Mahe´o
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 212 KB
- Volume
- 13
- Category
- Article
- ISSN
- 0195-6698
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
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
## 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.
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
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