{"title":"可解𝐴群的换向图","authors":"Rachel Carleton, Mark L. Lewis","doi":"10.1515/jgth-2023-0076","DOIUrl":null,"url":null,"abstract":"Let 𝐺 be a finite group. Recall that an 𝐴-group is a group whose Sylow subgroups are all abelian. In this paper, we investigate the upper bound on the diameter of the commuting graph of a solvable 𝐴-group. Assuming that the commuting graph is connected, we show when the derived length of 𝐺 is 2, the diameter of the commuting graph will be at most 4. In the general case, we show that the diameter of the commuting graph will be at most 6. In both cases, examples are provided to show that the upper bound of the commuting graph cannot be improved.","PeriodicalId":50188,"journal":{"name":"Journal of Group Theory","volume":"56 1","pages":""},"PeriodicalIF":0.4000,"publicationDate":"2024-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The commuting graph of a solvable 𝐴-group\",\"authors\":\"Rachel Carleton, Mark L. Lewis\",\"doi\":\"10.1515/jgth-2023-0076\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let 𝐺 be a finite group. Recall that an 𝐴-group is a group whose Sylow subgroups are all abelian. In this paper, we investigate the upper bound on the diameter of the commuting graph of a solvable 𝐴-group. Assuming that the commuting graph is connected, we show when the derived length of 𝐺 is 2, the diameter of the commuting graph will be at most 4. In the general case, we show that the diameter of the commuting graph will be at most 6. In both cases, examples are provided to show that the upper bound of the commuting graph cannot be improved.\",\"PeriodicalId\":50188,\"journal\":{\"name\":\"Journal of Group Theory\",\"volume\":\"56 1\",\"pages\":\"\"},\"PeriodicalIF\":0.4000,\"publicationDate\":\"2024-08-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Group Theory\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1515/jgth-2023-0076\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Group Theory","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1515/jgth-2023-0076","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}
Let 𝐺 be a finite group. Recall that an 𝐴-group is a group whose Sylow subgroups are all abelian. In this paper, we investigate the upper bound on the diameter of the commuting graph of a solvable 𝐴-group. Assuming that the commuting graph is connected, we show when the derived length of 𝐺 is 2, the diameter of the commuting graph will be at most 4. In the general case, we show that the diameter of the commuting graph will be at most 6. In both cases, examples are provided to show that the upper bound of the commuting graph cannot be improved.
期刊介绍：
The Journal of Group Theory is devoted to the publication of original research articles in all aspects of group theory. Articles concerning applications of group theory and articles from research areas which have a significant impact on group theory will also be considered.
Topics:
Group Theory-
Representation Theory of Groups-
Computational Aspects of Group Theory-
Combinatorics and Graph Theory-
Algebra and Number Theory
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
