On the realizability of a graph as the Gruenberg-Kegel graph of a finite group (Q2630483)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the realizability of a graph as the Gruenberg-Kegel graph of a finite group |
scientific article |
Statements
On the realizability of a graph as the Gruenberg-Kegel graph of a finite group (English)
0 references
28 July 2016
0 references
Let \(G\) be a finite group. Denote by \(\pi(G)\) the set of all prime divisors of the order of \(G\) and by \(\omega(G)\) the spectrum of \(G\), i.e., the set of all its element orders. The set \(\omega(G)\) defines the Gruenberg-Kegel graph (or the prime graph) \(\Gamma(G)\) of \(G\); in this graph the vertex set is \(\pi(G)\) and different vertices \(p\) and \(q\) are adjacent if and only if \(pq\in\omega(G)\). A graph \(\Gamma\) with \(|\pi(G)|\) vertices is realizable as Gruenberg-Kegel graph of a group \(G\) if there exists a vertices marking of \(\Gamma\) by distinct primes from \(\pi(G)\) such that the marked graph is equal to \(\Gamma(G)\). A graph \(\Gamma\) is realizable as Gruenberg-Kegel graph of a group if \(\Gamma\) is realizable as Gruenberg-Kegel graph of an appropriate group \(G\). In this paper, the authors prove that a complete bipartite graph \(K_{m,n}\) is realizable as Gruenberg-Kegel graph of a group if and only if \(m+n\leq 6\) and \((m,n)\neq(3,3)\). Moreover, it is shown that if graph \(K_{1,5}\) is realizable as Gruenberg-Kegel graph of a group \(G\), then \(\pi(G)=\{2,3,7,13,19,37\}\), \(O_2(G)\neq 1\), and \(G/O_2(G)\cong{^2G_2(27)}\).
0 references
finite groups
0 references
Gruenberg-Kegel graphs
0 references
prime graphs
0 references
realizability of graphs
0 references
complete bipartite graphs
0 references
sets of element orders
0 references