群的广义非可普赖图

IF 0.6 3区 数学 Q3 MATHEMATICS
S. Anukumar Kathirvel, Peter J. Cameron, T. Tamizh Chelvam
{"title":"群的广义非可普赖图","authors":"S. Anukumar Kathirvel, Peter J. Cameron, T. Tamizh Chelvam","doi":"10.1007/s10801-024-01310-5","DOIUrl":null,"url":null,"abstract":"<p>Let <i>G</i> be a finite group with identity <i>e</i> and <span>\\( H \\ne \\{e\\}\\)</span> be a subgroup of <i>G</i>. The generalized non-coprime graph <span>\\(\\varGamma _{G,H}\\)</span> of <span>\\( G \\)</span> with respect to <span>\\(H\\)</span> is the simple undirected graph with <span>\\(G \\setminus \\{e \\}\\)</span> as the vertex set and two distinct vertices <span>\\( x \\)</span> and <span>\\( y\\)</span> are adjacent if and only if <span>\\(\\gcd (|x|,|y|) \\ne 1\\)</span> and either <span>\\(x \\in H\\)</span> or <span>\\(y \\in H\\)</span>, where |<i>x</i>| is the order of <span>\\(x\\in G\\)</span>. In this paper, we study certain graph theoretical properties of generalized non-coprime graphs of finite groups, concentrating on cyclic groups. More specifically, we obtain necessary and sufficient conditions for the generalized non-coprime graph of a cyclic group to be in the class of stars, paths, triangle-free, complete bipartite, complete, split, claw-free, chordal or perfect graphs. Then we show that widening the class of groups to all finite nilpotent groups gives us no new graphs, but we give as an example of contrasting behaviour the class of EPPO groups (those in which all elements have prime power order). We conclude with a connection to the Gruenberg–Kegel graph.\n</p>","PeriodicalId":14926,"journal":{"name":"Journal of Algebraic Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Generalized non-coprime graphs of groups\",\"authors\":\"S. Anukumar Kathirvel, Peter J. Cameron, T. Tamizh Chelvam\",\"doi\":\"10.1007/s10801-024-01310-5\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>Let <i>G</i> be a finite group with identity <i>e</i> and <span>\\\\( H \\\\ne \\\\{e\\\\}\\\\)</span> be a subgroup of <i>G</i>. The generalized non-coprime graph <span>\\\\(\\\\varGamma _{G,H}\\\\)</span> of <span>\\\\( G \\\\)</span> with respect to <span>\\\\(H\\\\)</span> is the simple undirected graph with <span>\\\\(G \\\\setminus \\\\{e \\\\}\\\\)</span> as the vertex set and two distinct vertices <span>\\\\( x \\\\)</span> and <span>\\\\( y\\\\)</span> are adjacent if and only if <span>\\\\(\\\\gcd (|x|,|y|) \\\\ne 1\\\\)</span> and either <span>\\\\(x \\\\in H\\\\)</span> or <span>\\\\(y \\\\in H\\\\)</span>, where |<i>x</i>| is the order of <span>\\\\(x\\\\in G\\\\)</span>. In this paper, we study certain graph theoretical properties of generalized non-coprime graphs of finite groups, concentrating on cyclic groups. More specifically, we obtain necessary and sufficient conditions for the generalized non-coprime graph of a cyclic group to be in the class of stars, paths, triangle-free, complete bipartite, complete, split, claw-free, chordal or perfect graphs. Then we show that widening the class of groups to all finite nilpotent groups gives us no new graphs, but we give as an example of contrasting behaviour the class of EPPO groups (those in which all elements have prime power order). We conclude with a connection to the Gruenberg–Kegel graph.\\n</p>\",\"PeriodicalId\":14926,\"journal\":{\"name\":\"Journal of Algebraic Combinatorics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2024-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Algebraic Combinatorics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s10801-024-01310-5\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Algebraic Combinatorics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10801-024-01310-5","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

摘要

让 G 是一个有限群,其特征是 e,而 H 是 G 的一个子群。当且仅当(\(\gcd (|x|. |y|)\ne 1\) 和(\(\gcd (|x|. |y|)\ne 1\) 中的任意一个)且(\(\gcd (|x|. |y|)\ne 1\) 和(\(\gcd (|x|. |y|)\ne 1\) 中的任意一个)时,\(\gcd (|x|. |y|)\ne 1\) 是\(\gcd (|x|、|)且(x 在 H 中)或(y 在 H 中)是相邻的,其中 |x| 是(x 在 G 中)的阶。)在本文中,我们研究了有限群的广义非彗星图的某些图论性质,主要集中在循环群上。更具体地说,我们得到了循环群的广义非彗星图属于星图、路径图、无三角形图、完全双方图、完全图、分裂图、无爪图、弦图或完美图类的必要条件和充分条件。然后我们证明,将群的类别扩大到所有有限零能群,并不会得到新的图形,但我们举出了 EPPO 群(所有元素都具有素幂阶的群)这类图形作为对比行为的例子。最后,我们将其与格伦伯格-凯格尔图联系起来。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Generalized non-coprime graphs of groups

Let G be a finite group with identity e and \( H \ne \{e\}\) be a subgroup of G. The generalized non-coprime graph \(\varGamma _{G,H}\) of \( G \) with respect to \(H\) is the simple undirected graph with \(G \setminus \{e \}\) as the vertex set and two distinct vertices \( x \) and \( y\) are adjacent if and only if \(\gcd (|x|,|y|) \ne 1\) and either \(x \in H\) or \(y \in H\), where |x| is the order of \(x\in G\). In this paper, we study certain graph theoretical properties of generalized non-coprime graphs of finite groups, concentrating on cyclic groups. More specifically, we obtain necessary and sufficient conditions for the generalized non-coprime graph of a cyclic group to be in the class of stars, paths, triangle-free, complete bipartite, complete, split, claw-free, chordal or perfect graphs. Then we show that widening the class of groups to all finite nilpotent groups gives us no new graphs, but we give as an example of contrasting behaviour the class of EPPO groups (those in which all elements have prime power order). We conclude with a connection to the Gruenberg–Kegel graph.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
1.50
自引率
12.50%
发文量
94
审稿时长
6-12 weeks
期刊介绍: The Journal of Algebraic Combinatorics provides a single forum for papers on algebraic combinatorics which, at present, are distributed throughout a number of journals. Within the last decade or so, algebraic combinatorics has evolved into a mature, established and identifiable area of mathematics. Research contributions in the field are increasingly seen to have substantial links with other areas of mathematics. The journal publishes papers in which combinatorics and algebra interact in a significant and interesting fashion. This interaction might occur through the study of combinatorial structures using algebraic methods, or the application of combinatorial methods to algebraic problems.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信