On σ-arithmetic graphs of finite groups
Abstract
Let G be a finite group and σ a partition of the set of all? primes P, that is, σ =\σi i∈ I \, where P=i∈ I σi and σi σj= for all i j. If n is an integer, we write σ(n)=\σi σi π (n) \ and σ (G)=σ (|G|). We call a graph with the set of all vertices V()=σ (G) (G 1) a σ-arithmetic graph of G, and we associate with G 1 the following three directed σ-arithmetic graphs: (1) the σ-Hawkes graph Hσ (G) of G is a σ-arithmetic graph of G in which (σi, σj)∈ E(Hσ (G)) if σj∈ σ (G/F\σi\(G)); (2) the σ-Hall graph σ Hal(G) of G in which (σi, σj)∈ E(σ Hal(G)) if for some Hall σi-subgroup H of G we have σj∈ σ (NG(H)/HCG(H)); (3) the σ-Vasil'ev-Murashko graph Nσ (G) of G in which (σi, σj)∈ E(Nσ(G)) if for some Nσ -critical subgroup H of G we have σi ∈ σ (H) and σj∈ σ (H/F\σi\(H)). In this paper, we study the structure of G depending on the properties of these three graphs of G.