On the Isomorphism Problem for Finite Cayley Graphs of Bounded Valency

In this: publication
By this: publisher
In this Subject: <a title="Mathematics and Statistics" href="/content/subcat?j_subject=195&j_availability=">Mathematics and Statistics
By this author: Li C.H. ;&nbsp; Praeger C.E.

Authors: Li C.H.; Praeger C.E.

Source: European Journal of Combinatorics, Volume 20, Number 4, April 1999 , pp. 279-292(14)

Buy & download fulltext article:

Price: $52.63 plus tax (Refund Policy)

Abstract:

For a subset S of a group G such that 1 notin 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 isin S . Each sigma isin Aut (G) induces an isomorphism from Cay(G , S) to the Cayley graph Cay(G , S). For a positive integer m , the group G is called an m-CI-group if, for all Cayley subsets S of size at most m , whenever Cay(G , S) cong Cay(G , T) there is an element sigma isin Aut(G) such that S = T . It is shown that if G is an m-CI-group for some m 4, then G = U × V , where (|U|, |V|) = 1, U is abelian, and V belongs to an explicitly determined list of groups. Moreover, Sylow subgroups of such groups satisfy some very restrictive conditions. This classification yields, as corollaries, improvements of results of Babai and Frankl. We note that our classification relies on the finite simple group classification. Copyright1999 Academic Press Copyright 1999 Academic Press