𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On Isomorphisms of Finite Cayley Graphs

✍ Scribed by M. Conder; C. Heng Li


Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
148 KB
Volume
19
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

✦ Synopsis


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 are CI-graphs; further, if G has the k-CI property for all k ≀ m, then G is called an m-CI-group, and a |G|-CI-group G is called a CI-group. In this paper, we prove that A 5 is not a 5-CI-group, that SL(2, 5) is not a 6-CI-group, and that all finite 6-CI-groups are soluble. Then we show that a nonabelian simple group has the 4-CI property if and only if it is A 5 , and that no nonabelian simple group has the 5-CI property. Also we give nine new examples of CI-groups of small order, which were found to be CI-groups with the assistance of a computer.


πŸ“œ SIMILAR VOLUMES


On the Isomorphism Problem for Finite Ca
✍ C.H. Li; C.E. Praeger πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 187 KB

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 Isomorphisms of Connected Cayley Grap
✍ Cai Heng Li πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 182 KB

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

Isomorphic Cayley graphs on nonisomorphi
✍ Morris, Joy πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 349 KB

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 the Isomorphisms of Cayley Graphs of
✍ Yan-Quan Feng; Yan-Pei Liu; Ming-Yao Xu πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 190 KB

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

Isomorphisms of Finite Cayley Digraphs o
✍ Cai Heng Li; Cheryl E. Praeger; Ming Yao Xu πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 377 KB

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

On finite groups with the cayley isomorp
✍ Li, Cai Heng; Praeger, Cheryl E.; Xu, Ming Yao πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 197 KB

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;