On finite CG-groups

2019/11/14 by Sekhar Jyoti Baishya, Baishya, Sekhar Jyoti
Computer Science · Engineering · Mathematics · #20D60 #20D99 #Coding theory and cryptography #FOS: Mathematics #Finite Group Theory Research #Group Theory (math.GR) #graph theory and CDMA systems #math.GR #msc:20D60 #msc:20D99

paper · pdf · doi:10.48550/arxiv.1911.06054

openalex publication_date 2019/11/14 · arxiv created 2020/10/22 · arxiv updated 2020/10/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

A finite group G is a CG-group if |\rm Cent(G) | = | G' |+2, where G' is the commutator subgroup and Cent(G) is the set of distinct element centralizers of G. In this paper we give some results on CG-groups. We also give a negative answer to \cite[Conjecture 2.3]con given by K. Khoramshahi and M. Zarrin.

Related

• On the conjecture of groups with the same number of centralizer
• Counting Centralizers of a Finite Group with an Application in Constructing the Commuting Conjugacy Class Graph
• On finite groups with nine centralizers
• On n-centralizer CA-groups
• Counting the Number of Centralizers of 2-Element Subsets in a Finite Group