paper

On Connectivity of Comaximal Subgroup Graph

arXiv:2606.22904

Abstract

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

9 pages

On Connectivity of Comaximal Subgroup Graph · wovepaper