RUS  ENG
Full version
JOURNALS // Sibirskii Matematicheskii Zhurnal // Archive

Sibirsk. Mat. Zh., 2008 Volume 49, Number 4, Pages 934–944 (Mi smj1890)

This article is cited in 27 papers

2-Recognizability by prime graph of $PSL(2,p^2)$

A. Khosravia, B. Khosravibc

a Faculty of Mathematical Sciences and Computer Engineering, University For Teacher Education
b Institute for Studies in Theoretical Physics and Mathematics
c Dept. of Pure Math., Faculty of Math. and Computer Sci., Amirkabir University of Technology (Tehran Polytechnic), Tehran, Iran

Abstract: Let $G$ be a finite group and let $\Gamma(G)$ be the prime graph of $G$. Assume $p$ prime. We determine the finite groups $G$ such that $\Gamma(G)=\Gamma(PSL(2,p^2))$ and prove that if $p\ne2,3,7$ is a prime then $k(\Gamma(PSL(2,p^2)))=2$. We infer that if $G$ is a finite group satisfying $|G|=|PSL(2,p^2)|$ and $\Gamma(G)=\Gamma(PSL(2,p^2))$ then $G\cong PSL(2,p^2)$. This enables us to give new proofs for some theorems; e.g., a conjecture of W. Shi and J. Bi. Some applications are also considered of this result to the problem of recognition of finite groups by element orders.

Keywords: simple group, prime graph, element order, linear group.

UDC: 519.542

Received: 05.06.2006
Revised: 16.10.2007


 English version:
Siberian Mathematical Journal, 2008, 49:4, 749–757

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024