OD-characterization of almost simple groups related to U3(5)

Let G be a finite group with order |G| = p .11 p .22 . p .k k , where p 1 < p 2 < . < p k are prime numbers. One of the well-known simple graphs associated with G is the prime graph (or Gruenberg-Kegel graph) denoted by .(G) (or GK(G)). This graph is constructed as follows: The vertex set of it is .(G) = {p 1, p 2, ., p k } and two vertices p i , p j with i . j are adjacent by an edge (and we write p i . p j ) if and only if G contains an element of order p i p j . The degree deg(p i ) of a vertex p i . .(G) is the number of edges incident on p i . We define D(G):= (deg(p 1), deg(p 2), ., deg(p k )), which is called the degree pattern of G. A group G is called k-fold OD-characterizable if there exist exactly k nonisomorphic groups H such that |H| = |G| and D(H) = D(G). Moreover, a 1-fold OD-characterizable group is simply called OD-characterizable. Let L:= U 3(5) be the projective special unitary group. In this paper, we classify groups with the same order and degree pattern as an almost simple group related to L. In fact, we obtain that L and L.2 are OD-characterizable; L.3 is 3-fold OD-characterizable; L.S 3 is 6-fold OD-characterizable.