On Co-Maximal Subgroup Graph of a Group
Abstract
The co-maximal subgroup graph (G) of a group G is a graph whose vertices are non-trivial proper subgroups of G and two vertices H and K are adjacent if HK=G. In this paper, we continue the study of (G), especially when (G) has isolated vertices. We define a new graph *(G), which is obtained by removing isolated vertices from (G). We characterize when *(G) 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 G.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.