关于第 II 组的共最大子群图

IF 1.1 4区数学 Q1 MATHEMATICS

Ricerche di Matematica Pub Date : 2023-12-20 DOI:10.1007/s11587-023-00836-3

Angsuman Das, Manideepa Saha

{"title":"关于第 II 组的共最大子群图","authors":"Angsuman Das, Manideepa Saha","doi":"10.1007/s11587-023-00836-3","DOIUrl":null,"url":null,"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.","PeriodicalId":21373,"journal":{"name":"Ricerche di Matematica","volume":"231 1","pages":""},"PeriodicalIF":1.1000,"publicationDate":"2023-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On co-maximal subgroup graph of a group-II\",\"authors\":\"Angsuman Das, Manideepa Saha\",\"doi\":\"10.1007/s11587-023-00836-3\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":21373,\"journal\":{\"name\":\"Ricerche di Matematica\",\"volume\":\"231 1\",\"pages\":\"\"},\"PeriodicalIF\":1.1000,\"publicationDate\":\"2023-12-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Ricerche di Matematica\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s11587-023-00836-3\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Ricerche di Matematica","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s11587-023-00836-3","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 0

摘要

在这篇续篇论文中，我们将继续研究群 G 的共最大子群图（\Gamma (G)\) ）。我们将进一步讨论一些关于连通性以及当（\Gamma (G)\) 是无边的结果。此外，我们还研究了 \(\Gamma (G)\) 的独立数、色度数和完备性。在这个过程中，我们证明了如果独立数适当小，那么底层群是可解的。我们还对某些群的同最大子群图进行了分类，直至同构。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

On co-maximal subgroup graph of a group-II

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Ricerche di Matematica Mathematics-Applied Mathematics

CiteScore

3.00

自引率

8.30%

发文量

期刊介绍： “Ricerche di Matematica” publishes high-quality research articles in any field of pure and applied mathematics. Articles must be original and written in English. Details about article submission can be found online.