RECOGNITION BY PRIME GRAPH OF 2Dp(3) WHERE p = 2n + 1 ¸ 5

In this paper, as the main result, we show that the simple group 2Dp(3) is recognizable by prime graph. In other words, we show that if G is a finite group such that ¡(G) = ¡(2Dp(3)), then G »= 2Dp(3)