Acta mathematica scientia,Series B ›› 2011, Vol. 31 ›› Issue (2): 441-450.doi: 10.1016/S0252-9602(11)60244-0

• Articles • Previous Articles     Next Articles

OD-CHARACTERIZATION OF ALMOST SIMPLE GROUPS RELATED TO U6(2)

 ZHANG Liang-Cai1, SHI Wu-Jie2   

  1. 1.College of Mathematics and Statistics, Chongqing University, Shapingba 401331, China|2.School of Mathematics and Statistics, Chongqing University of Arts and Sciences, Youngchuan 402160, China
  • Received:2007-11-06 Revised:2010-10-27 Online:2011-03-20 Published:2011-03-20
  • Supported by:

    This work is partly supported by Natural Science Foundation Project of CQ CSTC (2010BB9206), NNSF of China (10871032), Fundamental Research Funds for the Central Universities (Chongqing University, CDJZR10100009), and National Science Foundation for Distinguished Young Scholars of China (11001226)

Abstract:

Let G be a finite group and π(G)={p1, p2, …, pk} be the set of the primes dividing the order of G. We define its prime graph Γ(G) as follows. The vertex set of this graph is π(G), and two distinct vertices p, q are joined by an edge if and only if pq πe(G). In this case, we write pq. For p π(G),  put deg(p):=|{q π(G) | pq|, which is called the degree of p. We also define D(G):=(deg(p1), deg(p2), … , deg(pk)), where p1<p2<…<pk, which is called the degree pattern  of G.  We say a  group G is k-fold OD-characterizable if there exist exactly k non-isomorphic finite groups with the same order and  degree pattern as G. Specially, a 1-fold OD-characterizable  group is simply called an OD-characterizable group. Let L:=U6(2). In this article, we classify all finite groups with the same order and degree pattern as an almost simple groups related to L. In fact, we prove that L and  L.2 are OD-characterizable, L.3 is 3-fold OD-characterizable, and L.S3 is 5-fold OD-characterizable.

Key words: Almost simple group, prime graph, degree of a vertex, degree pattern

CLC Number: 

  • 20D05
Trendmd