Finite groups whose noncyclic graphs have positive genus (Q2221044)

For a finite noncyclic group \(G\) denote by \(\mathrm{Cyc}(G)\) a set of elements \(a\) of \(G\) such that \(\langle a,b\rangle\) is cyclic for each \(b\) of \(G\). The noncyclic graph of \(G\) is a graph with the vertex set \(G\setminus\) \(\mathrm{Cyc}(G)\) so that two distinct vertices \(x\) and \(y\) are adjacent if \(\langle x,y\rangle\) is not cyclic. It is shown that for a fixed nonnegative integer \(k\), there are at most finitely many finite noncyclic groups whose noncyclic graphs have (non)orientable genus \(k\). The finite noncyclic groups whose noncyclic graphs have (non)orientable genus \(1,\,2,\,3\) and \(4\), respectively are also classified.