English

Co-maximal subgroup graph characterized by forbidden subgraphs

Combinatorics 2023-10-11 v1

Abstract

In this communication, the co-maximal subgroup graph Γ(G)\Gamma(G) of a finite group GG is examined when GG is a finite nilpotent group, finite abelian group, dihedral group DnD_n, dicyclic group Q2nQ_{2^n}, and pp-group. We derive the necessary and sufficient conditions for Γ(G)\Gamma(G) to be a cluster graph, triangle-free graph, claw-free graph, cograph, chordal graph, threshold graph and split graph. For the case of finite nilpotent group, we are able to classify it entirely. Moreover, we derive the complete structure of finite abelian group GG such that Γ(G)\Gamma(G) is a split graph. We leave the readers with a few unsolved questions.

Keywords

Cite

@article{arxiv.2310.06392,
  title  = {Co-maximal subgroup graph characterized by forbidden subgraphs},
  author = {Pallabi Manna and Santanu Mandal and Manideepa Saha},
  journal= {arXiv preprint arXiv:2310.06392},
  year   = {2023}
}
R2 v1 2026-06-28T12:45:36.398Z