Title of article
QUASIRECOGNITION BY PRIME GRAPH OF FINITE SIMPLE GROUPS {}^2D_n(3)
Author/Authors
خسروي ، بهروز نويسنده School of Mathematics, Institute for Research in Fundamental sciences (IPM), P.O.Box: 19395{5746, Tehran, Iran, Khosravi, Behrooz , مرادي، حسين نويسنده Dept. of Pure Math., Faculty of Math. and Computer Sci., Amirkabir University of Technology (Tehran Polytechnic), Moradi, Hossein
Issue Information
فصلنامه با شماره پیاپی 0 سال 2014
Pages
10
From page
47
To page
56
Abstract
Let G be a nite group. In [Ghasemabadi et al., characterizations of the simple group
2Dn(3) by prime graph and spectrum, Monatsh Math., 2011] it is proved that if n is odd, then 2Dn(3)
is recognizable by prime graph and also by element orders. In this paper we prove that if n is even,
then D = 2Dn(3) is quasirecognizable by prime graph, i.e. every nite group G with ??(G) = ??(D) has
a unique nonabelian composition factor and this factor is isomorphic to D.
Journal title
International Journal of Group Theory
Serial Year
2014
Journal title
International Journal of Group Theory
Record number
1364887
Link To Document