Groups with the same prime graph as the orthogonal group \(B_n(3)\). (Q359377)

Let \(G\) be a finite group. The prime graph of \(G\) is denoted by \(\Gamma(G)\). In [Monatsh. Math. 166, No. 2, 239-253 (2012; Zbl 1252.20011)], the authors proved that if \(\Gamma(G)=\Gamma(B_p(3))\), where \(p>3\) is a prime, then \(G\cong B_p(3)\) or \(C_p(3)\). In the present paper, as the main result, the authors prove that if \(\Gamma(G)=\Gamma(B_n(p))\), where \(n\geq 6\), then \(G\) has a unique nonabelian composition factor and the factor is isomorphic to \(B_n(3)\) or \(C_n(3)\). In the case, when \(n\geq 9\) is odd, this result was obtained by \textit{F. Ghasembadi} and \textit{A. Iranmanesh} [Bull. Iran. Math. Soc. 38, No. 3, 647-668 (2012)]. Also, the authors prove that if \(\Gamma(G)=\Gamma(B_4(3))\), then \(G\) has a unique nonabelian composition factor and the factor is isomorphic to \(B_4(3)\), \(C_4(3)\), or \(^2D_4(3)\). As a consequence, the group \(B_{2k+1}(3)\) is recognizable by its spectrum (i.e., the set of element orders) and the group \(B_{2k}(3)\) is quasirecognizable by its spectrum. This generalizes a result by \textit{R. Shen, W. Shi} and \textit{M. R. Zinov'eva} [Sib. Math. J. 51, No. 2, 244-254 (2010); translation from Sib. Mat. Zh. 51, No. 2, 303-315 (2010; Zbl 1210.20020)].