NCF-distinguishablity by prime graph of PGL(2,p) where p is a prime
From MaRDI portal
Publication:640272
Recommendations
- Characterization by prime graph of \(\text{PGL}(2,p^k)\) where \(p\) and \(k>1\) are odd.
- n-RECOGNITION BY PRIME GRAPH OF THE SIMPLE GROUP PSL(2,q)
- On the unrecognizability by prime graph for the almost simple group \(\mathrm{PGL}(2,9)\)
- On the prime graph of a finite group.
- On the prime graph of \(\text{PSL}(2,p)\) where \(p>3\) is a prime number.
Cites Work
- scientific article; zbMATH DE number 4130647 (Why is no real title available?)
- scientific article; zbMATH DE number 5081116 (Why is no real title available?)
- scientific article; zbMATH DE number 3906699 (Why is no real title available?)
- scientific article; zbMATH DE number 1099518 (Why is no real title available?)
- scientific article; zbMATH DE number 1564071 (Why is no real title available?)
- scientific article; zbMATH DE number 2101579 (Why is no real title available?)
- scientific article; zbMATH DE number 775176 (Why is no real title available?)
- scientific article; zbMATH DE number 3197229 (Why is no real title available?)
- scientific article; zbMATH DE number 5180932 (Why is no real title available?)
- A Diophantine equation which arises in the theory of finite groups
- A characterization of some alternating and symmetric groups
- A characterization of the finite simple group \(L_{16}(2)\) by its prime graph.
- Die Zerlegungsmatrizen der Gruppen \(PSL(2,p^f)\)
- Groups Having Strongly Self-Centralizing 3-Centralizers
- Groups with the same prime graph as a CIT simple group.
- On the prime graph of \(\text{PSL}(2,p)\) where \(p>3\) is a prime number.
- Prime graph components of finite groups
- Prime graph components of the simple groups of Lie type over the field of even characteristic
- Quasirecognition by prime graph of the simple group \(^2F_4(q)\).
- Quasirecognition by prime graph of the simple group \(^2G_2(q)\).
- Recognition of the finite almost simple groups PGL2(q) by their spectrum
- Recognition of the finite simple groups \(L_3(2^m)\) and \(U_3(2^m)\) by their element orders
- The Characterization of Almost Simple GroupsPGL(2,p) by Their Element Orders
- The Prime Graph of a Sporadic Simple Group
- The diameter of the prime graph of a finite group
- n-RECOGNITION BY PRIME GRAPH OF THE SIMPLE GROUP PSL(2,q)
Cited In (10)
- Recognition by prime graph of the almost simple group \(\mathrm{PGL}(2, 25)\)
- Characterization by prime graph of \(\text{PGL}(2,p^k)\) where \(p\) and \(k>1\) are odd.
- On composition factors of a group with the same prime graph as \(L_n(5)\)
- Quasirecognition by prime graph of \(^2D_n(3^\alpha)\) where \(n=4m+1\geq 21\) and \(\alpha\) is odd
- Groups with the same prime graph as the simple group \(D_n(5)\).
- p-SOLVABILITY AND A GENERALIZATION OF PRIME GRAPHS OF FINITE GROUPS
- On the composition factors of a group with the same prime graph as B n (5)
- Groups with the same prime graph as the orthogonal group \(B_n(3)\).
- Quasirecognition by prime graph of finite simple groups \(L_n(2)\) and \(U_n(2)\).
- On some Frobenius groups with the same prime graph as the almost simple group \(\mathrm{PGL}(2,49)\)
Uses Software
This page was built for publication: NCF-distinguishablity by prime graph of \(\text{PGL}(2,p)\) where \(p\) is a prime
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q640272)