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-
Isomorphisms of Connected Cayley Digraphs
โ Scribed by Cai Heng Li
- Publisher
- Springer Japan
- Year
- 1998
- Tongue
- English
- Weight
- 163 KB
- Volume
- 14
- Category
- Article
- ISSN
- 0911-0119
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Let G be a finite group, S a subset of G" [1], and let Cay(G, S ) denote the Cayley digraph of G with respect to S. If, for all subsets S, T of G"[1] of size at most m, Cay(G, S )$Cay(G, T) implies that S \_ =T for some \_ # Aut(G), then G is called an m-DCI-group. In this paper, we prove that, for
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
For a finite group G and a subset S of G which does not contain the identity of G, denote by Cay(G, S) the Cayley digraph of G with respect to S. An automorphism \_ of the group G induces a graph isomorphism from Cay(G, S) to Cay(G, S \_ ). In this paper, we investigate groups G and Cayley digraphs