Quasirecognition by the prime graph of the group \(C_n(2)\), where \(n\neq 3\) is odd.

zbMath1238.20039MaRDI QIDQ648440

Mahnaz Foroudi Ghasemabadi, Ali Iranmanesh

Publication date: 22 November 2011

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: http://math.usm.my/bulletin/html/vol34_3_11.html

zbMATH Keywords

symplectic groupsfinite simple groupsprime graphssets of element ordersquasirecognizable groups

Mathematics Subject Classification ID

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

Related Items (5)

Criterion of unrecognizability of a finite group by its Gruenberg-Kegel graph ⋮ Quasirecognition by prime graph of finite simple groups \(L_n(2)\) and \(U_n(2)\). ⋮ Recognizing simple \(K_4\)-groups by few special conjugacy class sizes ⋮ Unnamed Item ⋮ ON COMPOSITION FACTORS OF A GROUP WITH THE SAME PRIME GRAPH AS Ln(5)

This page was built for publication: Quasirecognition by the prime graph of the group \(C_n(2)\), where \(n\neq 3\) is odd.