On finite groups with a reducible permutability-graph (Q678141)

For a nonhamiltonian finite group \(G\), \(\Gamma(G)\) denotes the graph associated to the permutability relation between the nonnormal subgroups of \(G\). The permutability rank of \(G\), denoted by \(\rho(G)\), is the number of connected components of \(\Gamma(G)\) and the diameter \(\Delta(G)\) of \(G\) is the maximum among the diameters of its components. Various results are obtained about finite groups \(G\) with \(\Gamma(G)\) disconnected (i.e. with \(\rho(G)\geq 2\)), called here reducible w.r.p. groups. That such groups are all soluble was established by \textit{M. Bianchi} and the authors [Ann. Mat. Pura Appl., IV. Ser. 169, 251-268 (1995; Zbl 0849.20014)]; here these groups are studied in detail. For example, a complete classification of the nilpotent reducible w.r.p. groups with \(\Delta(G)=2\) is provided in the second part of the paper, while in the first part the authors deal with nonnilpotent such groups and obtain satisfactory information about their structure.