School of Sciences, Nantong University, 226007, Nantong, P. R. China
Abstract
Let $G$ be a finite group and $\Gamma(G)$ the prime graph of $G$. Recently people have been using prime graphs to study simple groups. Naturally we pose a question: can we use prime graphs to study almost simple groups or non-simple groups? In this paper some results in this respect are obtained and as follows: $G\cong S_p$ if and only if $|G|=|S_p|$ and $\Gamma(G)=\Gamma(S_p)$, where $p$ is a prime.
Zhang, Q., Wang, J., & Liu, W. (2014). A characterization of the symmetric group of prime degree. Bulletin of the Iranian Mathematical Society, 40(2), 473-480.
MLA
Zhang, Q., Wang, J., & Liu, W. "A characterization of the symmetric group of prime degree", Bulletin of the Iranian Mathematical Society, 40, 2, 2014, 473-480.
HARVARD
Zhang Q., Wang J., Liu W. (2014). 'A characterization of the symmetric group of prime degree', Bulletin of the Iranian Mathematical Society, 40(2), pp. 473-480.
CHICAGO
Q. Zhang, J. Wang & W. Liu, "A characterization of the symmetric group of prime degree," Bulletin of the Iranian Mathematical Society, 40 2 (2014): 473-480,
VANCOUVER
Zhang Q., Wang J., Liu W. A characterization of the symmetric group of prime degree. BIMS. 2014;40(2):473-480.
