On isomorphisms of connected Cayley graphs. II (Q1127874)

For a finite group \(G\) and a subset \(S\) of \(G\setminus\{1\}\), denote by \(\text{Cay}(G,S)\) the Cayley digraph of \(G\) with respect to \(S\), that is, the directed graph with vertex set \(G\) and edge set \(\{(a,b)\mid a,b\in G,\;ba^{-1}\in S\}\). If \(S=S^{-1}:=\{s^{-1}\mid s\in S\}\), then \(\text{Cay}(G,S)\) may be viewed as an undirected graph. If \(\sigma\in\text{Aut}(G)\) then \(\sigma\) induces an isomorphism from \(\text{Cay}(G,S)\) to \(\text{Cay}(G,S^\sigma)\). The graph \(\text{Cay}(G,S)\) is called a CI-graph of \(G\) if, for any \(T\subset G\), \(\text{Cay}(G,S)\cong\text{Cay}(G,T)\) if and only if \(T=S^\sigma\) for some \(\sigma\in\text{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 connected \(m\)-DCI-group (or connected \(m\)-CI-group) if all connected Cayley digraphs (or undirected graphs, respectively) of \(G\) of (out)-valency at most \(m\) are CI-graphs. For a group \(G\), let \(p(G)\) be the smallest prime divisor of \(| G|\). It was previously shown [\textit{C. H. Li}, Discrete Math. 178, 109-122 (1998; Zbl 0886.05078)], that all finite groups \(G\) are connected \((p(G)-1)\)-DCI-groups and all \(p(G)\)-groups \(G\) are connected \(2(p(G)-1)\)-CI-groups. In this paper, for every prime \(p\), we construct infinitely many finite groups \(G\) such that \(p(G)=p\) and \(G\) is neither a connected \(p\)-DCI-group nor a connected \(2p\)-CI-group, which provides solutions for several open problems in this area.