Quasirecognition by the prime graph of L₃(q) where 3

MaRDI QIDQ459196zbMATH OpenFDO

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

Publication date 8 October 2014

Published in Bulletin of the Iranian Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

finite linear groupsfinite simple groupsprime graphsquasirecognizable groupsrecognizable 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) Linear algebraic groups over finite fields (20G40)

Recommendations

• Quasirecognition by prime graph of \(U_3(q)\) where \(2<q=p^\alpha<100\).
• 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 groups G₂(q) and ^2B₂(q).
• Quasirecognition by prime graph of L_n(2^) for some n and

Cited in

(7)

• \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
• Quasirecognition by prime graph of \(U_3(q)\) where \(2<q=p^\alpha<100\).
• On composition factors of a group with the same prime graph as \(L_n(5)\)
• scientific article; zbMATH DE number 5875511 (Why is no real title available?)
• scientific article; zbMATH DE number 5180932 (Why is no real title available?)
• Quasirecognition by prime graph of finite simple groups L_n(2) and U_n(2).

This page was built for publication: Quasirecognition by the prime graph of \(L_3(q)\) where \(3<q<100\).

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