Resumen de Quasirecognition by prime graph of simple group D_n(3)

Behrooz Khosravi, Zeinab Akhlaghi, Maryam Khatami

• Let G be a nite group. The prime graph ..(G) of G is de ned as follows. The vertices of ..(G) are the primes dividing the order of G and two distinct vertices p and p�� are joined by an edge if there is an element in G of order pp��. It is proved that Dn(q), with disconnected prime graph, is quasirecognizable by their element orders.

  In this paper as the main result, we show that Dn(3), where n 2 fp; p+1g for an odd prime p > 3, is quasirecognizable by its prime graph.