|
This article is cited in 2 scientific papers (total in 2 papers)
Finite groups whose prime graphs do not contain triangles. III
W. Guoab, M. R. Zinov'evacd, A. S. Kondrat'evcd a University of Science and Technology of China, Anhui, Hefei
b Hainan University
c N.N. Krasovskii Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences, Ekaterinburg
d Ural Federal University named after the First President of Russia B. N. Yeltsin, Ekaterinburg
Abstract:
The prime graph or the Gruenberg–Kegel graph of a finite group $G$ is the graph whose vertices are the prime divisors of the order of $G$ and two distinct vertices $p$ and $q$ are adjacent if and only if $G$ contains an element of order $pq$. This paper continues the study of the problem of describing the finite nonsolvable groups whose prime graphs do not contain triangles. We describe the groups in the case when a group has an element of order $6$ and the order of its solvable radical is divisible by a prime greater than $3$.
Keywords:
finite group, nonsolvable group, prime graph or Gruenberg–Kegel graph without triangles.
Received: 15.03.2022 Revised: 29.08.2022 Accepted: 10.10.2022
Citation:
W. Guo, M. R. Zinov'eva, A. S. Kondrat'ev, “Finite groups whose prime graphs do not contain triangles. III”, Sibirsk. Mat. Zh., 64:1 (2023), 65–71; Siberian Math. J., 64:1 (2023), 56–61
Linking options:
https://www.mathnet.ru/eng/smj7745 https://www.mathnet.ru/eng/smj/v64/i1/p65
|
Statistics & downloads: |
Abstract page: | 97 | Full-text PDF : | 8 | References: | 15 | First page: | 6 |
|