The issue of when two Cayley digraphs on different abelian groups of prime power order can be isomorphic is examined. This had previously been determined by Anne Joseph for squares of primes; her results are extended.
On Cayley digraphs on nonisomorphic 2-groups
✍ Scribed by István Kovács; Mary Servatius
- Publisher
- John Wiley and Sons
- Year
- 2011
- Tongue
- English
- Weight
- 180 KB
- Volume
- 70
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
✦ Synopsis
A necessary and sufficient condition is given for two Cayley digraphs X 1 = Cay(G 1 , S 1 ) and X 2 = Cay(G 2 , S 2 ) to be isomorphic, where the groups G i are nonisomorphic abelian 2-groups, and the digraphs X i have a regular cyclic group of automorphisms. Our result extends that of Morris [J Graph Theory 3 (1999), 345-362] concerning p-groups G i , where p is an odd prime.
📜 SIMILAR VOLUMES
It is proven that every connected Cayley graph X , of valency at least three, on a Hamiltonian group is either Hamilton laceable when X is bipartite, or Hamilton connected when X is not bipartite.
Let G be a finite group, and let Cay(G, S) be a Cayley digraph of G. If, for all T ⊂ G, Cay(G, S) ∼ = Cay(G, T ) implies S α = T for some α ∈ Aut(G), then Cay(G, S) is called a CI-graph of G. For a group G, if all Cayley digraphs of valency m are CI-graphs, then G is said to have the m-DCI property;
For a positive integer m, a group G is said to have the m-DCI property if, for any Cayley digraphs Cay(G, S) and Cay(G, T ) of G of valency m (that is, |S| = |T | =m), Cay(G, S)$Cay(G, T ) if and only if S \_ =T for some \_ # Aut(G). This paper is one of a series of papers towards characterizing fin
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
In this paper a short proof is given of a theorem of M . Gromov in a particular case using a combinatorial argument .