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 #sigma# of the group G induces a graph isomorphism from Cay(G, S) to Cay(G, S~#sigma#). In this paper, we investigate groups G and Cayley digraphs Cay(G, S) of G for which the following condition holds: for any T is contained in G, Cay(G, S) approx= Cay(G, T) if and only if S~#sigma# = T for some the point #sigma# belong to (is member of) the set Aut(G). for a positive integer m, a group G is called an m-DCI-group if the condition holds for all Cayley digraphs of valency at most m; while G is called a connected m-DCI-group if it holds for all connected digraphs of valency at most m. This paper contributes towards a complete classification of finite m-DCI-groups for m >= 2. It was previously proved by C. H. Li et al. (1998, J. Combin. Theory Ser. B 74, 164 183) that finite m-DCI-groups for m >= 2 belong to an explicitly determined list yq.J(m) of groups. However, it is still an open problem to determine which members of yq.J(m) are rally m-DCI-groups. We reduce this problem to the problem of determining whether all subgroups of groups in yq.J(m) are connected m-DCI-groups. Then we give a complete classification of finite 2-DCI-groups.
展开▼
