Quasirecognition by the prime graph of the group C_n(2), where n 3 is odd.
From MaRDI portal
Publication:648440
Recommendations
- Quasirecognition by prime graph of \(C_n(4)\), where \(n\geq 17\) is odd
- Quasirecognition by prime graph of the simple groups \(G_2(q)\) and \(^2B_2(q)\).
- Quasirecognition by prime graph of the simple group \(B_n(2)\).
- 2-quasirecognizability of the simple groups \(B_n(p)\) and \(C_n(p)\) by prime graph.
- Quasirecognition by prime graph of \(L_n(2^\alpha)\) for some \(n\) and \(\alpha\)
Cited in
(13)- On the coincidence of Gruenberg-Kegel graphs of an almost simple group and a nonsolvable Frobenius group
- p-SOLVABILITY AND A GENERALIZATION OF PRIME GRAPHS OF FINITE GROUPS
- Quasirecognition by prime graph of \(L_n(2^\alpha)\) for some \(n\) and \(\alpha\)
- \(C55\)-groups.
- Criterion of unrecognizability of a finite group by its Gruenberg-Kegel graph
- Quasirecognition by prime graph of \(C_n(4)\), where \(n\geq 17\) is odd
- A note on the adjacency criterion for the prime graph and the characterization of \(C_p(3)\).
- On nonabelian simple groups having the same prime graph as an alternating group.
- Quasirecognition by prime graph of the simple group \(B_n(2)\).
- \text{M}, \text{B} and \(\mathrm{Co}_1\) are recognisable by their prime graphs
- Quasirecognition by prime graph of finite simple groups \(L_n(2)\) and \(U_n(2)\).
- On composition factors of a group with the same prime graph as \(L_n(5)\)
- Recognizing simple \(K_4\)-groups by few special conjugacy class sizes
This page was built for publication: Quasirecognition by the prime graph of the group \(C_n(2)\), where \(n\neq 3\) is odd.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q648440)
