The diameter of the solvable graph of a finite group (Q1592617)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The diameter of the solvable graph of a finite group |
scientific article |
Statements
The diameter of the solvable graph of a finite group (English)
0 references
19 June 2001
0 references
Let \(G\) be a finite group. According to \textit{S. Abe} and \textit{N. Iiyori} [Hokkaido Math. J. 29, No. 2, 391-407 (2000; Zbl 0965.20008)], the solvable graph \(\Gamma_S(G)\) of \(G\) is defined as follows: the vertices are the prime divisors of \(|G|\) and two vertices \(p,q\) are joined by an edge if there is a solvable subgroup of \(G\) of order divisible by \(pq\). In the above-mentioned paper, Abe and Iiyori showed that \(\Gamma_S(G)\) is connected. Let \(d_S(p,q)\) be the distance between two vertices \(p,q\) in \(\Gamma_S(G)\). The diameter \(\text{diam}(\Gamma_S(G))\) is defined as the maximum of \(d_S(p,q)\) for any two vertices \(p,q\) of \(\Gamma_S(G)\). Using the classification of finite simple groups and the description of the connected components of the prime graph of \(G\) (see the papers of \textit{J. S. Williams} [J. Algebra 69, 487-513 (1981; Zbl 0471.20013)], the reviewer [Mat. Sb. 180, No. 6, 787-797 (1989; Zbl 0691.20013)], and \textit{N. Iiyori} and \textit{H. Yamaki} [J. Algebra 155, No. 2, 335-343 (1993; Zbl 0799.20016); Corrigenda ibid. 181, No. 2, 659 (1996; Zbl 0844.20008)]), the author proves that \(\text{diam}(\Gamma_S(G))\leq 4\) and \(d_S(2,p)\leq 3\) for any finite group \(G\) and for any prime divisor \(p\) of \(|G|\). It is shown that if \(G\) is the Mathieu simple group \(M_{23}\) then \(\text{diam}(\Gamma_S(G))=4\) and \(d_S(2,23)=3\).
0 references
finite groups
0 references
Sylow subgroups
0 references
prime graphs
0 references
solvable graphs
0 references
simple groups
0 references
solvable subgroups
0 references
connected components
0 references