Classification of finite C{\theta}{\theta}-groups with even order and its application

arXiv1703.00635MaRDI QIDQ6283799FDOQ6283799

Publication date: 2 March 2017

Abstract: A finite group of order divisible by 3 in which centralizers of 3-elements are 3-subgroups will be called a C{ heta}{ heta}-group. The prime graph (or Gruenberg-Kegel graph) of a finite group G is denoted by {Gamma}(G) (or GK(G)) and its a familiar. Also the degrees sequence of {Gamma}(G) is called the degree pattern of G and is denoted by D(G). In this paper, first we classify the finite C{ heta}{ heta}-groups with even order. Then we show that there are infinitely many C{ heta}{ heta}-groups with the same degree pattern. Finally, we proved that the simple group PSL(2, q) and the almost simple group PGL(2, q), where q > 9 is a power of 3, are determined by their degree pattern.

Mathematics Subject Classification ID

Arithmetic and combinatorial problems involving abstract finite groups (20D60) Finite simple groups and their classification (20D05) Simple groups: sporadic groups (20D08)

This page was built for publication: Classification of finite C{\theta}{\theta}-groups with even order and its application

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6283799)