Cayley digraphs and lexicographic product (Q934355)

Let \(X\) and \(Y\) be digraphs. By the lexicographic product \(X[Y]\), we mean the digraph whose vertex set \(V(X[Y])\) is \(V(X)\times V(Y)\) and whose arc set is \[ A(X[Y]) = \left\{((x,y),(x',y'))\mid (x,x')\in A(X), \text{ or }x=x' \text{ and } (y,y')\in A(Y)\right\}. \] Let \(G\) be a finite group and \(S\) a nonempty subset of \(G\) with \(1_G\notin S\). Then the Cayley digraph \(X={\text{Cay}}(G,S)\) of \(G\) with respect to \(S\) is the digraph whose vertex set \(V(X)\) is \(G\) and whose arc set is \(A(X)=\{(g,sg)\mid g\in G,s\in S\}\). The present paper proves that a Cayley digraph \(\Gamma=\text{Cay}(G,S)\) is a nontrivial lexicographic product if and only if there is a nontrivial subgroup \(H\) of \(G\) such that \(S\setminus H\) is a union of some double cosets of \(H\) in \(G\).