On finite groups with a reducible permutability-graph (Q678141): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf01759389 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2089602104 / rank | |||
Normal rank |
Latest revision as of 09:04, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On finite groups with a reducible permutability-graph |
scientific article |
Statements
On finite groups with a reducible permutability-graph (English)
0 references
14 August 1997
0 references
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.
0 references
permutability graphs
0 references
permutability relations
0 references
permutability ranks
0 references
numbers of connected components
0 references
finite groups
0 references
nilpotent reducible w.r.p. groups
0 references