A Note on the Adjacency Criterion for the Prime Graph and the Characterization of Cp(3)

DOI10.1142/S1005386712000429zbMATH Open1257.20013MaRDI QIDQ2909087

Shi Wujie, Huaiyu He

Publication date: 29 August 2012

Published in: Algebra Colloquium (Search for Journal in Brave)

zbMATH Keywords

finite simple groupsrecognizabilityprime graphsrecognition by spectrasets of element ordersspectra of finite groupsGruenberg-Kegel graphs

Mathematics Subject Classification ID

Could not fetch data.

Cites Work

• \(r\)-recognizability of \(B_n(q)\) and \(C_n(q)\) where \(n=2^m\geqslant 4\).
• Prime graph components of finite groups
• Prime power graphs for groups of Lie type
• Pure quantitative characterization of finite simple groups.
• An Adjacency Criterion for the Prime Graph of a Finite Simple Group

Related Items (5)

Finite groups isospectral to simple groups ⋮ On products of groups and indices not divisible by a given prime ⋮ On finite groups isospectral to simple classical groups. ⋮ A prime decomposition theorem for handcuff graphs in \(S^{3}\) ⋮ Recognition by spectrum for simple classical groups in characteristic 2.

This page was built for publication: A Note on the Adjacency Criterion for the Prime Graph and the Characterization of C_p(3)

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