Let $\omega \left(G\right)$ denote the set of element orders of a finite group $G$. If $H$ is a finite non-abelian simple group and $\omega \left(H\right)=\omega \left(G\right)$ implies $G$ contains a unique non-abelian composition factor isomorphic to $H$, then $G$ is called quasirecognizable by the set of its element orders. In this paper we will prove that the group $PS{L}_4\left(5\right)$ is quasirecognizable.

Let $G$ be a finite group and ${\pi }_e\left(G\right)$ be the set of element orders of $G$. Let $k\in {\pi }_e\left(G\right)$ and $m_k$ be the number of elements of order $k$ in $G$. Set $\mathrm{nse}\left(G\right):=\{m_k:k\in {\pi }_e\left(G\right)\}$. In fact $\mathrm{nse}\left(G\right)$ is the set of sizes of elements with the same order in $G$. In this paper, by $\mathrm{nse}\left(G\right)$ and order, we give a new characterization of finite projective special linear groups $L_2\left(p\right)$ over a field with $p$ elements, where $p$ is prime. We prove the following theorem: If $G$ is a group such that $\left|G\right|=|L_2\left(p\right)|$ and $\mathrm{nse}\left(G\right)$ consists of $1$, $p^2-1$, $p(p+ϵ)/2$ and some numbers divisible by $2p$, where $p$ is a prime...

Let $G$ be a finite group. The prime graph of $G$ is a graph whose vertex set is the set of prime divisors of $\left|G\right|$ and two distinct primes $p$ and $q$ are joined by an edge, whenever $G$ contains an element of order $pq$. The prime graph of $G$ is denoted by $\Gamma \left(G\right)$. It is proved that some finite groups are uniquely determined by their prime graph. In this paper, we show that if $G$ is a finite group such that $\Gamma \left(G\right)=\Gamma \left(B_n\left(5\right)\right)$, where $n\ge 6$, then $G$ has a unique nonabelian composition factor isomorphic to $B_n\left(5\right)$ or $C_n\left(5\right)$.