On Co-Maximal Subgroup Graph of a Group
Angsuman Das, Manideepa Saha, Saba Al-Kaseasbeh

TL;DR
This paper investigates the properties of the co-maximal subgroup graph of a group, especially focusing on when the reduced graph is connected, complete, or star-shaped, and computes various graph parameters based on group properties.
Contribution
It introduces a new graph $ ext{Gamma}^*(G)$ by removing isolated vertices from the co-maximal subgroup graph and characterizes its structural properties.
Findings
Characterized when $ ext{Gamma}^*(G)$ is connected or complete.
Determined conditions for $ ext{Gamma}^*(G)$ to be a star graph or have a universal vertex.
Calculated graph parameters like diameter, girth, and bipartiteness in relation to group properties.
Abstract
The co-maximal subgroup graph of a group is a graph whose vertices are non-trivial proper subgroups of and two vertices and are adjacent if . In this paper, we continue the study of , especially when has isolated vertices. We define a new graph , which is obtained by removing isolated vertices from . We characterize when is connected, a complete graph, star graph, has an universal vertex etc. We also find various graph parameters like diameter, girth, bipartiteness etc. in terms of properties of .
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 · Advanced Graph Theory Research · graph theory and CDMA systems
