@article { author = {Zhang, Qingliang and Wang, Jinhua and Liu, Weijun}, title = {A characterization of the symmetric group of prime degree}, journal = {Bulletin of the Iranian Mathematical Society}, volume = {40}, number = {2}, pages = {473-480}, year = {2014}, publisher = {Iranian Mathematical Society (IMS)}, issn = {1017-060X}, eissn = {1735-8515}, doi = {}, 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‎.}, keywords = {characterization,symmetric group,Prime graph}, url = {http://bims.iranjournals.ir/article_510.html}, eprint = {http://bims.iranjournals.ir/article_510_dee5dd7e5a3f35385b5ddbc71bf0cc1b.pdf} }