Quasirecognition by prime graph of finite simple groups ${}^2D_n(3)$
Let $G$ be a finite group. In [Ghasemabadi et al., characterizations of the simple group ${}^2D_n(3)$ by prime graph and spectrum, Monatsh Math., 2011] it is proved that if $n$ is odd, then ${}^2D _n(3)$ is recognizable by prime graph and also by element orders. In this paper we prove that if...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Isfahan
2014-12-01
|
Series: | International Journal of Group Theory |
Subjects: | |
Online Access: | http://www.theoryofgroups.ir/pdf_5254_b31e2bb7e4d6f7188c9fd129dd78758f.html |