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 …

Let (Γ,∗) be a finite group and S a possibly empty subset of Γ containing its non-self-
invertible elements. In this paper, we introduce the inverse graph associated with Γ whose …

Abstract The Gruenberg–Kegel graph (or the prime graph)\varGamma (G) Γ (G) of a finite
group G is a graph, in which the vertex set is the set of all prime divisors of the order of G and …

Abstract The Gruenberg–Kegel graph of a group is the undirected graph whose vertices are
those primes which occur as the order of an element of the group, and distinct vertices p, q …

arXiv:1606.01402v2 [math.GR] 12 Jun 2016 Page 1 arXiv:1606.01402v2 [math.GR] 12 Jun
2016 FINITE ALMOST SIMPLE GROUPS WHOSE GRUENBERG–KEGEL GRAPHS COINCIDE …

The most recent advancements in algebra and graph theory enable us to ask a
straightforward question: what practical use does this graph connected with a mathematical …

We study the properties and applications of the directed graph, introduced by Hawkes in
1968, of a finite group. The vertex set of coincides with and is an edge if and only if. In the …

The power graph of a group G is a simple and undirected graph with vertex set G and two
distinct vertices are adjacent if one is a power of the other. In this article, we characterize …

Let G be a finite group. Denote by π (G) the set of all prime divisors of the order of G and by
ω (G) the spectrum of G, ie the set of all its element orders. The set ω (G) defines the …

The study of groups from geometric viewpoint has recently become one of the focus of
researches in group theory, which started with the Cayley graph. Later, the study grew …