The Gruenberg-Kegel graph of finite solvable rational groups (Q6140056)

A finite group \(G\) is called \textit{rational} if for every element \(g \in G\), all the generators of \(\langle g \rangle\) are conjugate in \(G\) (or equivalently, if every character of \(G\) takes values in the field of rational numbers). The Gruenberg-Kegel graph of \(G\) (or prime graph) is the undirected graph \(\Gamma{GK}(G)\) whose vertices are the primes dividing \(|G|\) and an edge connects a pair of different vertices \(p\) and \(q\) whenever \(G\) has an element of order \(pq\). The authors complete the classification of the Gruenberg-Kegel graphs of finite solvable rational groups initiated in [\textit{A. Bächle} et al., Forum Math. 35, No. 2, 409--429 (2023; Zbl 1520.16025)]. As a consequence they obtain the Corollary B: If \(G\) is a finite solvable rational group of order divisible by \(15\) then \(G\) has elements of order \(6, 10\) and \(15\).