pith. sign in

arxiv: 2606.22904 · v1 · pith:FH663OWFnew · submitted 2026-06-22 · 🧮 math.GR · math.CO

On Connectivity of Comaximal Subgroup Graph

classification 🧮 math.GR math.CO
keywords gammagraphfinitesubgroupverticesco-maximalcontainscycle
0
0 comments X
read the original abstract

The co-maximal subgroup graph $\Gamma(G)$ of a finite group $G$ is defined to be a graph with the set of all non-trivial proper subgroups of $G$ as the set of vertices and two distinct vertices $H$ and $K$ are adjacent if and only if $HK=G$. The deleted co-maximal subgroup graph of $G$, denoted by $\Gamma^*(G)$, is defined as the graph obtained by removing the isolated vertices from $\Gamma(G)$. In this paper, we prove that for any finite group $G$, $\Gamma^*(G)$ is connected. Furthermore, we show that $\Gamma^*(G)$ either contains a cycle or is a star. When $\Gamma^*(G)$ contains a cycle, its girth is either $3$ or $4$. Finally, we classify all finite groups $G$ for which $\Gamma^*(G)$ is a star.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.