Forbidden subgraphs on conjugacy class graphs of groups
Abstract
Let be a finite group. The \textit{commuting/nilpotent/solvable conjugacy class graph} (, , or ) is a simple graph whose vertex set consists of all non-central conjugacy classes of . Two vertices and are adjacent if and only if there exist elements and such that forms an abelian, nilpotent, or solvable subgroup of , respectively.\par In this paper, we mainly investigate cographs (it is -free), chordal graphs (it is -free ), split graphs (it contains no induced subgraph isomorphic to , and ), threshold graphs (it contains no induced subgraph isomorphic to , , and ), and claw-free graphs (it contains no vertex with three pairwise non-adjacent neighbours) in terms of forbidden induced subgraphs in / /.\par We provide a complete classification of these properties for EPPO groups, groups of order , and nilpotent groups. Additionally, we characterize the induced subgraphs in the commuting conjugacy class graph for symmetric and alternating groups. For solvable groups such as dihedral, dicyclic, and generalized dihedral groups, we establish complete results. Moreover, we fully characterize the graphs for the Mathieu groups , , and , as well as certain minimal simple groups such as Suzuki groups and . For other minimal simple groups, such as , , and (where and ), we demonstrate that the solvable conjugacy class graph is always a cograph. Finally, we present several open problems, highlighting further directions for research in this area.
Cite
@article{arxiv.2406.01305,
title = {Forbidden subgraphs on conjugacy class graphs of groups},
author = {Papi Ray and Sonakshee Arora},
journal= {arXiv preprint arXiv:2406.01305},
year = {2025}
}
Comments
29 Pages