Quasirecognition by prime graph of finite simple groups L n (2) and U n (2)

Let G be a finite group. The prime graph ??(G) of G is defined as follows. The vertices of ??(G) are the primes dividing the order of G and two distinct vertices p, p?? are joined by an edge if G has an element of order pp??. Let L=L _n (2) or U _n (2), where n?R17. We prove that L is quasirecognizable by prime graph, i.e. if G is a finite group such that ??(G)=??(L), then G has a unique nonabelian composition factor isomorphic to L. As a consequence of our result we give a new proof for the recognition by element orders of L _n (2). Also we conclude that the simple group U _n (2) is quasirecognizable by element orders.