Criterion of unrecognizability of a finite group by its Gruenberg–Kegel graph
Abstract
The Gruenberg--Kegel graph Γ(G) associated with a finite group G is an undirected graph without loops and multiple edges whose vertices are the prime divisors of |G| and in which vertices p and q are adjacent in Γ(G) if and only if G contains an element of order pq. This graph has been the subject of much recent interest; one of our goals here is to give a survey of some of this material, relating to groups with the same Gruenberg--Kegel graph. However, our main aim is to prove several new results. Among them are the following. • There are infinitely many finite groups with the same Gruenberg--Kegel graph as the Gruenberg--Kegel of a finite group G if and only if there is a finite group H with non-trivial solvable radical such that Γ(G)=Γ(H). • There is a function F on the natural numbers with the property that if a finite n-vertex graph whose vertices are labelled by pairwise distinct primes is the Gruenberg--Kegel graph of more than F(n) finite groups, then it is the Gruenberg--Kegel graph of infinitely many finite groups. (The function we give satisfies F(n)=O(n7), but this is not best possible.) • If a finite graph Gamma whose vertices are labelled by pairwise distinct primes is the Gruenberg--Kegel graph of only finitely many finite groups, then all such groups are almost simple; moreover, Gamma has at least three pairwise non-adjacent vertices, and each vertex is non-adjacent to at least one other vertex, in particular, 2 is non-adjacent to at least one odd vertex. • Groups whose power graphs, or commuting graphs, are isomorphic have the same Gruenberg--Kegel graph. • The groups 2G2(27) and E8(2) are uniquely determined by the isomorphism types of their Gruenberg--Kegel graphs.
Citation
Cameron , P J & Maslova , N 2022 , ' Criterion of unrecognizability of a finite group by its Gruenberg–Kegel graph ' , Journal of Algebra , vol. 607 , no. Part A , pp. 186-213 . https://doi.org/10.1016/j.jalgebra.2021.12.005
Publication
Journal of Algebra
Status
Peer reviewed
ISSN
0021-8693Type
Journal article
Description
Funding: This work was supported by the Russian Science Foundation (project no. 19-71-10067).Collections
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Related items
Showing items related by title, author, creator and subject.
-
Automorphism groups of countable algebraically closed graphs and endomorphisms of the random graph
Dolinka, Igor; Gray, Robert Duncan; McPhee, Jillian Dawn; Mitchell, James David; Quick, Martyn (2016-05) - Journal articleWe establish links between countable algebraically closed graphs and the endomorphisms of the countable universal graph R. As a consequence we show that, for any countable graph Γ, there are uncountably many maximal subgroups ... -
Tournaments and even graphs are equinumerous
Royle, Gordon F.; Praeger, Cheryl E.; Glasby, S. P.; Freedman, Saul Daniel; Devillers, Alice (2023-03-01) - Journal articleA graph is called odd if there is an orientation of its edges and an automorphism that reverses the sense of an odd number of its edges and even otherwise. Pontus von Brömssen (né Andersson) showed that the existence of ... -
On the difference of the enhanced power graph and the power graph of a finite group
Biswas, Sucharita; Cameron, Peter J.; Das, Angsuman; Dey, Hiranya Kishore (2024-11) - Journal articleThe difference graph of a finite group D (G) is the difference of the enhanced power graph of G and the power graph of G, where all isolated vertices are removed. In this paper we study the connectedness and perfectness ...