On Independence Number of Comaximal Subgroup Graph

Abstract

In this paper, we establish sharp thresholds on the independence number of the comaximal subgroup graph $\Gamma (G)$ that guarantee solvability, supersolvability, and nilpotency of the underlying group $G$. Specifically: \begin{itemize} \item For solvability, we prove that any group $G$ with independence number $\alpha (\Gamma (G))\le 51$ must be solvable, and show that the alternating group $A_5$ is uniquely determined by its graph. \item For supersolvability, we show that $\alpha (\Gamma (G))\le 14$ implies $G$ is supersolvable, except for three explicit exceptions. \item For nilpotency, we prove that $\alpha (\Gamma (G))\le 6$ ensures nilpotency, except for five groups. \end{itemize} Finally, we conclude with some open issues involving domination parameters.

arXiv comment13 pages