A note on the adjacency criterion for the prime graph and the characterization of \(C_p(3)\). (Q2909087)

Let \(G\) be a finite group and \(\omega(G)\) denote the set of element orders and \(\pi(G)\) denote the set of prime divisors of \(|G|\). The Gruenberg-Kegel graph of \(G\) is a graph with vertex set \(\pi(G)\) where two distinct vertices \(p\) and \(q\) are adjacent by an edge if and only if \(pq\in\pi(G)\). A group \(G\) is said to be recognizable by spectrum if every finite group \(H\) with \(\omega(H)=\omega(G)\) is isomorphic to \(G\).NEWLINENEWLINE In the paper under review the authors first correct an error in a paper by \textit{A. V. Vasil'ev} and \textit{E. P. Vdovin}, [Algebra Logika 44, No. 6, 682-725 (2005); translation in Algebra Logic 44, No. 6, 381-406 (2005; Zbl 1104.20018)], then they apply their result to the following theorem about the simple group \(C_p(3)\) where \(p\) is a prime number. Let \(L=C_p(3)\) where \(p\) is a prime number. Then \(L\) is recognizable by spectrum when \(p>2\), and is non-recognizable by spectrum if \(p=2\).