Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-15T22:59:16.040Z Has data issue: false hasContentIssue false

Co-maximal Graphs of Subgroups of Groups

Published online by Cambridge University Press:  20 November 2018

Saieed Akbari
Affiliation:
Department of Mathematical Sciences, Sharif University of Technology, Tehran, Iran e-mail: s_akbari@sharif.edu e-mail: babak.math@gmail.com
Babak Miraftab
Affiliation:
Department of Mathematical Sciences, Sharif University of Technology, Tehran, Iran e-mail: s_akbari@sharif.edu e-mail: babak.math@gmail.com
Reza Nikandish
Affiliation:
Department of Basic Sciences, Jundi-Shapur University of Technology, Dezful, Iran e-mail: r.nikandish@ipm.ir
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Let $H$ be a group. The co-maximal graph of subgroups of $H$ , denoted by $\Gamma \left( H \right)$ , is a graph whose vertices are non-trivial and proper subgroups of $H$ and two distinct vertices $L$ and $K$ are adjacent in $\Gamma \left( H \right)$ if and only if $H\,=\,LK$ . In this paper, we study the connectivity, diameter, clique number, and vertex chromatic number of $\Gamma \left( H \right)$ . For instance, we show that if $\Gamma \left( H \right)$ has no isolated vertex, then $\Gamma \left( H \right)$ is connected with diameter at most 3. Also, we characterize all finitely groups whose co-maximal graphs are connected. Among other results, we show that if $H$ is a finitely generated solvable group and $\Gamma \left( H \right)$ is connected, and moreover, the degree of a maximal subgroup is finite, then $H$ is finite. Furthermore, we show that the degree of each vertex in the co-maximal graph of a general linear group over an algebraically closed field is zero or infinite.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 2017