Quasirecognition by prime graph of simple group D_n(3)

DOI10.5486/PMD.2011.4851zbMath1260.20038OpenAlexW2037099787MaRDI QIDQ4913499

Zeinab Akhlaghi, Behrooz Khosravi, Maryam Khatami

Publication date: 5 April 2013

Published in: Publicationes Mathematicae Debrecen (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.5486/pmd.2011.4851

zbMATH Keywords

finite simple groupsprime graphssets of element ordersrecognizable groupsquasirecognizable 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 (6)

QUASIRECOGNITION BY PRIME GRAPH OF SOME ORTHOGONAL GROUPS OVER THE BINARY FIELD ⋮ Criterion of unrecognizability of a finite group by its Gruenberg-Kegel graph ⋮ Quasirecognition of E6(q) by the orders of maximal abelian subgroups ⋮ Groups with the same prime graph as the orthogonal group \(B_n(3)\). ⋮ On \(r\)-recognition by prime graph of \(B_p(3)\) where \(p\) is an odd prime. ⋮ Recognition by prime graph of \(^2D_{2^m+1}(3)\).

This page was built for publication: Quasirecognition by prime graph of simple group D_n(3)