Characterizations of the simple group \(^2D_n(3)\) by prime graph and spectrum. (Q691040): Difference between revisions

Let \(G\) be a finite group. The set of all primes dividing \(|G|\) is denoted by \(\pi(G)\). The prime graph \(\Gamma(G)\) of \(G\) is defined as follows: the vertices are the elements of \(\pi(G)\), and two distinct vertices \(p,q\) are joined by an edge if and only if there is an element of order \(pq\) in \(G\). In the given paper, the authors prove that if \(\Gamma(G)=\Gamma({^2D_n(3)})\), where \(n\geq 5\) is odd, then \(G\cong{^2D_n(3)}\). As a consequence, the simple group \({^2D_n(3)}\) is recognizable by its spectrum, i.e., the set of element orders. Note that the reviewer [in Sci. China, Ser. A 52, No. 2, 293-300 (2009; Zbl 1189.20026)] proved the last result for the special case \(n=2^m+1\).