Quasirecognition by prime graph of U₃(q) where 2

MaRDI QIDQ2837245zbMATH OpenFDO

Authors S. S. Salehi Amiri, Alireza Khalili Asboei, A. Iranmanesh, Abolfazl Tehranian

Publication date 10 July 2013

Published in International Journal of Group Theory (Search for Journal in Brave)

zbMATH Keywords

finite linear groupsfinite simple groupsprime graphsquasirecognitionquasirecognizable groupssets of element orders

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Simple groups: alternating groups and groups of Lie type (20D06) Arithmetic and combinatorial problems involving abstract finite groups (20D60)

Recommendations

• Quasirecognition by the prime graph of \(L_3(q)\) where \(3<q<100\).
• Quasirecognition by prime graph of finite simple groups L_n(2) and U_n(2).
• 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 the groups \(^2 D_{2n}(q)\) where \(q<10^5\)

Cited in

(5)

• Criterion of unrecognizability of a finite group by its Gruenberg-Kegel graph
• Characterization of \(\mathrm{PGL}(2, p^2)\) by order and some irreducible character degrees
• Quasirecognition by the prime graph of \(L_3(q)\) where \(3<q<100\).
• Quasirecognition by prime graph of C_n(4), where n 17 is odd
• scientific article; zbMATH DE number 5875511 (Why is no real title available?)

This page was built for publication: Quasirecognition by prime graph of \(U_3(q)\) where \(2<q=p^\alpha<100\).

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2837245)