Counting Centralizers of a Finite Group with an Application in Constructing the Commuting Conjugacy Class Graph
A. R. Ashrafi, M. A. Salahshour

TL;DR
This paper investigates the structure of centralizers in a specific non-abelian finite group and determines the exact number of element centralizers, also analyzing the structure of its commuting conjugacy class graph.
Contribution
It characterizes the centralizers in a non-abelian finite group with a specific quotient structure and determines the commuting conjugacy class graph.
Findings
The group has exactly [(p+1)^2+1] element centralizers.
The structure of the commuting conjugacy class graph is fully determined.
Provides insights into the relationship between group structure and centralizer properties.
Abstract
The set of all centralizers of elements in a finite group is denoted by and is called centralizer if . In this paper, the structure of centralizers in a non-abelian finite group with this property that is obtained. As a consequence, it is proved that such a group has exactly element centralizers and the structure of the commuting conjugacy class graph of is completely determined.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Coding theory and cryptography · graph theory and CDMA systems
