On co-maximal subgroup graph of a group-II

Abstract

In this sequel paper, we continue our study on co-maximal subgroup graph \(\Gamma (G)\) of a group G. We discuss some further results on connectedness and when \(\Gamma (G)\) is edgeless. Moreover, we study the independence number, chromatic number and perfectness of \(\Gamma (G)\). In the process, we show that if the independence number is suitably small, then the underlying group is solvable. We also classify co-maximal subgroup graphs of certain groups upto isomorphism.