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
Isomorphism problem for Cayley graphs of Zp3
β Scribed by Edward Dobson
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 389 KB
- Volume
- 147
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
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 was shown by Godsil [7] that the conjecture is true for k = 2. Recently, Nowitz [8] gave an example showing that Z k is not a CI-group with respect to graphs for all k >~ 6, and asked if there existed a prime Po so that ifp t> Po and p is prime, then Z 3 is not a CI-group with respect to graphs. We will answer this question negatively by showing that Z 3 is a CI-group with respect to graphs for all primes p. This work was done towards partial completion of a Ph.D. degree at Louisiana State University under the supervision of Professor B61a Bollobhs.
π 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
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-
A Cayley graph or digraph Cay(G, S) of a finite group G is called a CI-graph of G if, for any T/G, Cay(G, S)$Cay(G, T) if and only if S \_ =T for some \_ # Aut(G). We study the problem of determining which Cayley graphs and digraphs for a given group are CI-graphs. A finite group G is called a conne
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
## Abstract Let __Z__~__p__~ denote the cyclic group of order __p__ where __p__ is a prime number. Let __X__ = __X__(__Z__~__p__~, __H__) denote the Cayley digraph of __Z__~__p__~ with respect to the symbol __H__. We obtain a necessary and sufficient condition on __H__ so that the complete graph on