QUASIRECOGNITION BY PRIME GRAPH OF U3(q) WHERE 2 < q = p < 100

Abstract. let g be a finite group and let ??(g) be the prime graph of g. assume 2 < q = p < 100.we determine finite groups g such that ??(g) = ??(u3(q)) and prove that if q?3,5,9,17 , then u_3(q)is quasirecognizable by prime graph, i.e. if g is a finite group with the same prime graph as the finitesimple group u_3(q), then g has a unique non-abelian composition factor isomorphic to u3(q). as aconsequence of our results, we prove that the simple groups u_3(8) and u_3(11) are 4-recognizable and2-recognizable by prime graph, respectively. in fact, the group u_3(8) is the first example which is a4-recognizable by prime graph.