Quasirecognition by prime graph of the groups ^2 D₂n(q) where q<10⁵
Summary: Let \(G\) be a finite group. The prime graph \(\Gamma (G)\) of \(G\) is defined as follows: The set of vertices of \(\Gamma (G)\) is the set of prime divisors of \(| G|\) and two distinct vertices \(p\) and \(p'\) are connected in \(\Gamma (G)\), whenever \(G\) contains an element of order \(pp'\). A non-abelian simple group \(P\) is called recognizable by prime graph if for any finite group \(G\) with \(\Gamma (G)=\Gamma (P)\), \(G\) has a composition factor isomorphic to \(P\). It is been proved that finite simple groups \(^2 D_n(q)\), where \(n \neq 4 k\), are quasirecognizable by prime graph. Now in this paper we discuss the quasirecognizability by prime graph of the simple groups \(^2 D_{2 k}(q)\), where \(k \geq 9\) and \(q\) is a prime power less than \(10^5\).
- Quasirecognition by prime graph of the simple groups G₂(q) and ^2B₂(q).
- Quasirecognition by prime graph of finite simple groups ^2D_n(3).
- Quasirecognition by prime graph of finite simple groups L_n(2) and U_n(2).
- On the prime graph of a finite group.
- Quasirecognition by prime graph of simple group D_n(3).
- 2-recognizability by prime graph of \(\text{PSL}(2,p^2)\).
- An Adjacency Criterion for the Prime Graph of a Finite Simple Group
- Cocliques of maximal size in the prime graph of a finite simple group
- scientific article; zbMATH DE number 3906699 (Why is no real title available?)
- n-RECOGNITION BY PRIME GRAPH OF THE SIMPLE GROUP PSL(2,q)
- On quasirecognition by prime graph of the simple groups $A^{+}_{n}(p)$ and $A^{-}_{n}(p)$
- On recognition of finite simple groups with connected prime graph.
- Quasirecognition by prime graph of finite simple groups ^2D_n(3).
- Quasirecognition by prime graph of finite simple groups L_n(2) and U_n(2).
- Quasirecognition by prime graph of some orthogonal groups over the binary field.
- Quasirecognition by prime graph of the simple groups G₂(q) and ^2B₂(q).
- The Prime Graph of a Sporadic Simple Group
- Quasirecognition by prime graph of the simple group \(^2F_4(q)\).
- Criterion of unrecognizability of a finite group by its Gruenberg-Kegel graph
- Quasirecognition by prime graph of \(^2D_n(3^\alpha)\) where \(n=4m+1\geq 21\) and \(\alpha\) is odd
- 2-quasirecognizability of the simple groups B_n(p) and C_n(p) by prime graph.
- Quasirecognition by prime graph of \(U_3(q)\) where \(2<q=p^\alpha<100\).
- Quasirecognition by prime graph of some orthogonal groups over the binary field.
- Quasirecognition by prime graph of the simple groups G₂(q) and ^2B₂(q).
- On the prime graph of a finite group.
- n-RECOGNITION BY PRIME GRAPH OF THE SIMPLE GROUP PSL(2,q)
- scientific article; zbMATH DE number 7012558 (Why is no real title available?)
- Recognition by prime graph of the almost simple group \(\mathrm{PGL}(2, 25)\)
- Quasirecognition by prime graph of simple group D_n(3).
- On composition factors of a group with the same prime graph as \(L_n(5)\)
- On a conjecture about the quasirecognition by prime graph of some finite simple groups
- scientific article; zbMATH DE number 5875511 (Why is no real title available?)
- Quasirecognition by prime graph of finite simple groups ^2D_n(3).
- Quasirecognition by prime graph of finite simple groups L_n(2) and U_n(2).
- Recognition by prime graph of \(^2D_{2^m+1}(3)\).
- Quasirecognition by prime graph of \(^2D_p(3)\) where \(p=2^n+1\geq 5\) is a prime.
This page was built for publication: Quasirecognition by prime graph of the groups \(^2 D_{2n}(q)\) where \(q<10^5\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1649136)
