For a subset S of a group G such that 1 / โ S and S = S -1 , the associated Cayley graph Cay(G, S) is the graph with vertex set G such that {x, y} is an edge if and only if yx -1 โ S. Each ฯ โ Aut(G) induces an isomorphism from Cay(G, S) to the Cayley graph Cay(G, S ฯ ). For a positive integer m, th
On the Cayley isomorphism problem
โ Scribed by Edward Dobson
- Book ID
- 108315657
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 127 KB
- Volume
- 247
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
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
We prove that if two Cayley graphs of Z~ are isomorphic, then they are isomorphic by a group automorphism of Z 3. In [3], Babai and Frankl conjectured that Z 3 is a CI-group with respect to graphs for all primes p and k >t 1. The case k = 1 was settled positively by several authors [1,3,5,6]. It wa
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;
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-
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.