Co-maximal subgroup graph characterized by forbidden subgraphs
Abstract
In this communication, the co-maximal subgroup graph (G) of a finite group G is examined when G is a finite nilpotent group, finite abelian group, dihedral group Dn, dicyclic group Q2n, and p-group. We derive the necessary and sufficient conditions for (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 G such that (G) is a split graph. We leave the readers with a few unsolved questions.
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.