Canadian Mathematical Society www.cms.math.ca
 location:  Publications → journals → CMB
Abstract view

# Co-maximal Graphs of Subgroups of Groups

 Read article[PDF: 669KB]
Published:2016-11-10
Printed: Mar 2017
• Saieed Akbari,
Department of Mathematical Sciences, Sharif University of Technology, Tehran, Iran
• Babak Miraftab,
Department of Mathematical Sciences, Sharif University of Technology, Tehran, Iran
• Reza Nikandish,
Department of Basic Sciences, Jundi-Shapur University of Technology, Dezful, Iran
 Format: LaTeX MathJax PDF

## Abstract

Let $H$ be a group. The co-maximal graph of subgroups of $H$, denoted by $\Gamma(H)$, is a graph whose vertices are non-trivial and proper subgroups of $H$ and two distinct vertices $L$ and $K$ are adjacent in $\Gamma(H)$ if and only if $H=LK$. In this paper, we study the connectivity, diameter, clique number and vertex chromatic number of $\Gamma(H)$. For instance, we show that if $\Gamma(H)$ has no isolated vertex, then $\Gamma(H)$ is connected with diameter at most $3$. Also, we characterize all finite groups whose co-maximal graphs are connected. Among other results, we show that if $H$ is a finitely generated solvable group and $\Gamma(H)$ 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.
 Keywords: co-maximal graphs of subgroups of groups, diameter, nilpotent group, solvable group
 MSC Classifications: 05C25 - Graphs and abstract algebra (groups, rings, fields, etc.) [See also 20F65] 05E15 - Combinatorial aspects of groups and algebras [See also 14Nxx, 22E45, 33C80] 20D10 - Solvable groups, theory of formations, Schunck classes, Fitting classes, $\pi$-length, ranks [See also 20F17] 20D15 - Nilpotent groups, $p$-groups

 top of page | contact us | privacy | site map |

© Canadian Mathematical Society, 2017 : https://cms.math.ca/
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.32214757800102234, "perplexity": 780.6410340359718}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": false}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2017-51/segments/1512948520042.35/warc/CC-MAIN-20171212231544-20171213011544-00103.warc.gz"}