Conjecture of Li and Praeger concerning the isomorphisms of Cayley graphs of A5
β Scribed by Mingyao Xu; Xingui Fang; Hyo-Seob Sim; Young-Gheel Baik
- Book ID
- 105640449
- Publisher
- SP Science China Press
- Year
- 2001
- Tongue
- English
- Weight
- 424 KB
- Volume
- 44
- Category
- Article
- ISSN
- 1674-7283
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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 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
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