Let G be a finite group and let $GK(G)$ be the prime graph of G. We assume that $n$ is an odd number. In this paper, we show that if $GK(G)=GK(B_n(p))$, where $ngeq 9$ and $pin {3,5,7}$, then G has a unique nonabelian composition factor isomorphic to $B_n(p)$ or $C_n(p)$ . As consequences of our result, $B_n(p)$ is quasirecognizable by its spectrum and also by a new proof, the ...

Let G be a finite group and cd(G) denote the set of complex irreducible character degrees of G. In this paper, we prove that if G is a finite group and H is an almost simple group whose socle is a Mathieu group such that cd(G) = cd(H), then there exists an abelian subgroup A of G such that G/A is isomorphic to H. In view of Huppert’s conjecture (2000), we also provide some examples to show that...

Using the Luthar–Passi method, we investigate the classical Zassenhaus conjecture for the normalized unit group of the integral group ring of the Rudvalis sporadic simple group Ru. As a consequence, for this group we confirm Kimmerle’s conjecture on prime graphs.

A Cayley graph over a group G is said to be central if its connection set normal subset of G. We prove that every simple has at most two pairwise nonequivalent representations associated with the subgroups $${{\,\mathrm{Sym}\,}}(G)$$ induced by left and right multiplications also provide an algorithm which, given $$\Gamma $$ almost whose socle bounded index, finds full in time polynomial size