Liang Cai ZHANG, Wu Jie SHI
Let G be a finite group with order|G|=pα11pα22···pαkk,where p1<p2<···<pk 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)={p1,p2,...,pk}and two vertices pi,pj with i≠j are adjacent by an edge(and we write pi~pj)if and only if G contains an element of order pipj.The degree deg(pi)of a vertex pi∈π(G)is the number of edges incident on pi.We define D(G):=(deg(p1),deg(p2),...,deg(pk)),which is called the degree pattern of G.A group G is called k-fold OD-characterizable if there exist exactly k non-isomorphic 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:=U3(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.S3 is 6-fold OD-characterizable.