首页 | 本学科首页   官方微博 | 高级检索  
     


Recognizing Finite Groups Through Order and Degree Patterns
Authors:Yanxiong YAN  Guiyun CHEN  Liangcai ZHANG  Haijing XU
Affiliation:1. School of Mathematics and Statistics, Southwest University, Chongqing 400715, China; Department of Mathematics and Information Engineering, Chongqing University of Education, Chongqing 400067,China; College of Mathematics Science, Chongqing Normal University, Chongqing 401331, China
2. School of Mathematics and Statistics, Southwest University, Chongqing 400715,China
3. College of Mathematics and Statistics, Chongqing University, Shapingba, Chongqing 401331, China
4. School of Mathematics and Statistics, Southwest University, Chongqing 400715, China
Abstract:The degree pattern of a finite group G associated with its prime graph has been introduced by Moghaddamfar in 2005 and it is proved that the following simple groups are uniquely determined by their order and degree patterns: All sporadic simple groups, the alternating groups A p (p ≥ 5 is a twin prime) and some simple groups of the Lie type. In this paper, the authors continue this investigation. In particular, the authors show that the symmetric groups S p+3, where p + 2 is a composite number and p + 4 is a prime and 97 < pπ(1000!), are 3-fold OD-characterizable. The authors also show that the alternating groups A116 and A134 are OD-characterizable. It is worth mentioning that the latter not only generalizes the results by Hoseini in 2010 but also gives a positive answer to a conjecture by Moghaddamfar in 2009.
Keywords:Prime graph  Degree pattern  Degree of a vertex
本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录!
点击此处可从《数学年刊B辑(英文版)》浏览原始摘要信息
点击此处可从《数学年刊B辑(英文版)》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号