差分图有正格的幂零群

IF 16.4 1区 化学 Q1 CHEMISTRY, MULTIDISCIPLINARY
Parveen, Jitender Kumar
{"title":"差分图有正格的幂零群","authors":"Parveen, Jitender Kumar","doi":"10.1007/s11587-023-00830-9","DOIUrl":null,"url":null,"abstract":"<p>The power graph of a finite group <i>G</i> is a simple undirected graph with vertex set <i>G</i> and two vertices are adjacent if one is a power of the other. The enhanced power graph of a finite group <i>G</i> is a simple undirected graph whose vertex set is the group <i>G</i> and two vertices <i>a</i>, <i>b</i> are adjacent if there exists <span>\\(c \\in G\\)</span> such that both <i>a</i> and <i>b</i> are powers of <i>c</i>. In this paper, we study the difference graph <span>\\(\\mathcal {D}(G)\\)</span> of a finite group <i>G</i> which is the difference of the enhanced power graph and the power graph of <i>G</i> with all isolated vertices removed. We characterize all the finite nilpotent groups <i>G</i> such that the genus (or cross-cap) of the difference graph <span>\\(\\mathcal {D}(G)\\)</span> is at most 2.</p>","PeriodicalId":1,"journal":{"name":"Accounts of Chemical Research","volume":null,"pages":null},"PeriodicalIF":16.4000,"publicationDate":"2023-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Nilpotent groups whose difference graphs have positive genus\",\"authors\":\"Parveen, Jitender Kumar\",\"doi\":\"10.1007/s11587-023-00830-9\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>The power graph of a finite group <i>G</i> is a simple undirected graph with vertex set <i>G</i> and two vertices are adjacent if one is a power of the other. The enhanced power graph of a finite group <i>G</i> is a simple undirected graph whose vertex set is the group <i>G</i> and two vertices <i>a</i>, <i>b</i> are adjacent if there exists <span>\\\\(c \\\\in G\\\\)</span> such that both <i>a</i> and <i>b</i> are powers of <i>c</i>. In this paper, we study the difference graph <span>\\\\(\\\\mathcal {D}(G)\\\\)</span> of a finite group <i>G</i> which is the difference of the enhanced power graph and the power graph of <i>G</i> with all isolated vertices removed. We characterize all the finite nilpotent groups <i>G</i> such that the genus (or cross-cap) of the difference graph <span>\\\\(\\\\mathcal {D}(G)\\\\)</span> is at most 2.</p>\",\"PeriodicalId\":1,\"journal\":{\"name\":\"Accounts of Chemical Research\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":16.4000,\"publicationDate\":\"2023-12-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Accounts of Chemical Research\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s11587-023-00830-9\",\"RegionNum\":1,\"RegionCategory\":\"化学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"CHEMISTRY, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Accounts of Chemical Research","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s11587-023-00830-9","RegionNum":1,"RegionCategory":"化学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

摘要

有限群G的幂图是一个简单的无向图,其顶点集G和两个顶点相邻,如果其中一个是另一个的幂。有限群G的增强幂图是一个简单无向图,其顶点集为群G,且两个顶点a, b相邻,如果存在\(c \in G\)使得a和b都是c的幂。本文研究了有限群G的差分图\(\mathcal {D}(G)\),该差分图是所有孤立顶点被去掉后增强幂图与G的幂图之差。我们刻画了所有有限幂零群G,使得差分图\(\mathcal {D}(G)\)的属(或交叉帽)不超过2。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

Nilpotent groups whose difference graphs have positive genus

Nilpotent groups whose difference graphs have positive genus

The power graph of a finite group G is a simple undirected graph with vertex set G and two vertices are adjacent if one is a power of the other. The enhanced power graph of a finite group G is a simple undirected graph whose vertex set is the group G and two vertices a, b are adjacent if there exists \(c \in G\) such that both a and b are powers of c. In this paper, we study the difference graph \(\mathcal {D}(G)\) of a finite group G which is the difference of the enhanced power graph and the power graph of G with all isolated vertices removed. We characterize all the finite nilpotent groups G such that the genus (or cross-cap) of the difference graph \(\mathcal {D}(G)\) is at most 2.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Accounts of Chemical Research
Accounts of Chemical Research 化学-化学综合
CiteScore
31.40
自引率
1.10%
发文量
312
审稿时长
2 months
期刊介绍: Accounts of Chemical Research presents short, concise and critical articles offering easy-to-read overviews of basic research and applications in all areas of chemistry and biochemistry. These short reviews focus on research from the author’s own laboratory and are designed to teach the reader about a research project. In addition, Accounts of Chemical Research publishes commentaries that give an informed opinion on a current research problem. Special Issues online are devoted to a single topic of unusual activity and significance. Accounts of Chemical Research replaces the traditional article abstract with an article "Conspectus." These entries synopsize the research affording the reader a closer look at the content and significance of an article. Through this provision of a more detailed description of the article contents, the Conspectus enhances the article's discoverability by search engines and the exposure for the research.
×
引用
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学术官方微信