Quasirecognition by the prime graph of the group C_n(2), where n 3 is odd.
From MaRDI portal
(Redirected from Publication:648440)
Quasirecognition by the prime graph of the group \(C n(2)\), where \(n\neq 3\) is odd.
Quasirecognition by the prime graph of the group \(C n(2)\), where \(n\neq 3\) is odd.
Recommendations
- Quasirecognition by prime graph of C_n(4), where n 17 is odd
- Quasirecognition by prime graph of the simple groups G₂(q) and ^2B₂(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^) for some n and
Cited in
(13)- Recognizing simple \(K_4\)-groups by few special conjugacy class sizes
- On the coincidence of Gruenberg-Kegel graphs of an almost simple group and a nonsolvable Frobenius group
- \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
- A note on the adjacency criterion for the prime graph and the characterization of C_p(3).
- Quasirecognition by prime graph of L_n(2^) for some n and
- On nonabelian simple groups having the same prime graph as an alternating group.
- p-SOLVABILITY AND A GENERALIZATION OF PRIME GRAPHS OF FINITE GROUPS
- Quasirecognition by prime graph of C_n(4), where n 17 is odd
- On composition factors of a group with the same prime graph as \(L_n(5)\)
- C55-groups.
- Quasirecognition by prime graph of finite simple groups L_n(2) and U_n(2).
- Quasirecognition by prime graph of the simple group \(B_n(2)\).
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)
