Counting Centralizers of a Finite Group with an Application in Constructing the Commuting Conjugacy Class Graph

Abstract

The set of all centralizers of elements in a finite group G is denoted by Cent(G) and G is called n-centralizer if |Cent(G)| = n. In this paper, the structure of centralizers in a non-abelian finite group G with this property that GZ(G) Zp2 Zp2 is obtained. As a consequence, it is proved that such a group has exactly [(p+1)2+1] element centralizers and the structure of the commuting conjugacy class graph of G is completely determined.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…