Recognition by prime graph of ^2D₂^m+1(3).
From MaRDI portal
Publication:665887
Recommendations
- Quasirecognition by prime graph of finite simple groups ^2D_n(3).
- Characterizations of the simple group \(^2D_n(3)\) by prime graph and spectrum.
- Quasirecognition by prime graph of \(^2D_n(3^\alpha)\) where \(n=4m+1\geq 21\) and \(\alpha\) is odd
- Quasirecognition by prime graph of \(^2D_p(3)\) where \(p=2^n+1\geq 5\) is a prime.
- Quasirecognition by prime graph of the groups \(^2 D_{2n}(q)\) where \(q<10^5\)
Cites work
- 2-recognizability by prime graph of \(\text{PSL}(2,p^2)\).
- \(r\)-recognizability of \(B_n(q)\) and \(C_n(q)\) where \(n=2^m\geqslant 4\).
- A Diophantine equation which arises in the theory of finite groups
- An Adjacency Criterion for the Prime Graph of a Finite Simple Group
- Certain embeddings among finite groups of Lie type
- Characterization by prime graph of \(\text{PGL}(2,p^k)\) where \(p\) and \(k>1\) are odd.
- Decomposition of the Augmentation Ideal and of the Relation Modules of a Finite Group
- Finite simple unisingular groups of Lie type
- Groups with the same prime graph as a CIT simple group.
- scientific article; zbMATH DE number 3906699 (Why is no real title available?)
- scientific article; zbMATH DE number 2138213 (Why is no real title available?)
- scientific article; zbMATH DE number 3197229 (Why is no real title available?)
- n-RECOGNITION BY PRIME GRAPH OF THE SIMPLE GROUP PSL(2,q)
- On the prime graph of \(\text{PSL}(2,p)\) where \(p>3\) is a prime number.
- Prime graph components of finite almost simple groups
- Prime graph components of finite groups
- Quasirecognition by prime graph of \(^2D_p(3)\) where \(p=2^n+1\geq 5\) is a prime.
- Quasirecognition by prime graph of \(F_4(q)\) where \(q=2^n>2\).
- Quasirecognition by prime graph of finite simple groups L_n(2) and U_n(2).
- Quasirecognition by prime graph of simple group D_n(3).
- Quasirecognition by prime graph of the simple group \(^2F_4(q)\).
- Quasirecognition by prime graph of the simple group ^2G₂(q).
- Recognition by spectrum of the groups \(^2D_{2^m+1}(3)\).
- Recognition of finite groups by the prime graph
- RECOGNITION OF SOME FINITE SIMPLE GROUPS OF TYPE Dn(q) BY SPECTRUM
- Some characterizations of L₉(2) related to its prime graph.
- The Prime Graph of a Sporadic Simple Group
Cited in
(11)- \text{M}, \text{B} and \(\mathrm{Co}_1\) are recognisable by their prime graphs
- Criterion of unrecognizability of a finite group by its Gruenberg-Kegel graph
- Groups with the same prime graph as the simple group D_n(5).
- Quasirecognition by prime graph of \(^2D_n(3^\alpha)\) where \(n=4m+1\geq 21\) and \(\alpha\) is odd
- Quasirecognition by prime graph of some orthogonal groups over the binary field.
- 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)\).
- On composition factors of a group with the same prime graph as \(L_n(5)\)
- Recognition by spectrum for the simple group \(^2A_n(3)\) with disconnected prime graph
- Characterizations of the simple group \(^2D_n(3)\) by prime graph and spectrum.
- Unrecognizability by spectrum for the finite simple group \(^3D_4(2)\).
This page was built for publication: Recognition by prime graph of \(^2D_{2^m+1}(3)\).
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q665887)