On isomorphisms of connected Cayley graphs (Q1377853)

If \(S\) is a set of generators of a group \(G\) and \(\alpha \in \text{Aut}(G)\), then the Cayley graphs \(\text{Cay}(G,S)\) and \(\text{Cay}(G,S^\alpha)\) are obviously isomorphic. \(S\) is called a DCI-subset of \(G\) if, whenever \(\text{Cay}(G,S) \simeq \text{Cay}(G,T)\), then \(T = S^\alpha\) for some \(\alpha \in \text{Aut}(G)\). (There is a related notion, which applies when \(S=S^{-1}\), that is, when the Cayley graphs are treated as undirected graphs.) The author proves several results concerning this notion. For example, if \(G\) is finite and \(p\) is the least prime divisor of \(|G|\), then every generating set of \(G\) with at most \(p-1\) elements is a DCI-subset. These results are then applied to classify all vertex-- and edge--transitive graphs of order \(p^3\) and valency \(2p\), \(p\) a prime.