Genus and crosscap of normal subgroup based power graphs of finite groups

IF 1.1 4区 数学 Q1 MATHEMATICS Ricerche di Matematica Pub Date : 2024-08-07 DOI:10.1007/s11587-024-00882-5
Parveen, Manisha, Jitender Kumar
{"title":"Genus and crosscap of normal subgroup based power graphs of finite groups","authors":"Parveen, Manisha, Jitender Kumar","doi":"10.1007/s11587-024-00882-5","DOIUrl":null,"url":null,"abstract":"<p>Let <i>H</i> be a normal subgroup of a group <i>G</i>. The normal subgroup based power graph <span>\\(\\Gamma _H(G)\\)</span> of <i>G</i> is the simple undirected graph with vertex set <span>\\(V(\\Gamma _H(G))= (G\\setminus H)\\cup \\{e\\}\\)</span> and two distinct vertices <i>a</i> and <i>b</i> are adjacent if either <span>\\(aH = b^m H\\)</span> or <span>\\(bH=a^nH\\)</span> for some <span>\\(m,n \\in \\mathbb {N}\\)</span>. In this paper, we continue the study of normal subgroup based power graph and characterize all the pairs (<i>G</i>, <i>H</i>), where <i>H</i> is a non-trivial normal subgroup of <i>G</i>, such that the genus of <span>\\(\\Gamma _H(G)\\)</span> is at most 2. Moreover, we determine all the subgroups <i>H</i> and the quotient groups <span>\\(\\frac{G}{H}\\)</span> such that the cross-cap of <span>\\(\\Gamma _H(G)\\)</span> is at most three.</p>","PeriodicalId":21373,"journal":{"name":"Ricerche di Matematica","volume":null,"pages":null},"PeriodicalIF":1.1000,"publicationDate":"2024-08-07","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-024-00882-5","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

Let H be a normal subgroup of a group G. The normal subgroup based power graph \(\Gamma _H(G)\) of G is the simple undirected graph with vertex set \(V(\Gamma _H(G))= (G\setminus H)\cup \{e\}\) and two distinct vertices a and b are adjacent if either \(aH = b^m H\) or \(bH=a^nH\) for some \(m,n \in \mathbb {N}\). In this paper, we continue the study of normal subgroup based power graph and characterize all the pairs (GH), where H is a non-trivial normal subgroup of G, such that the genus of \(\Gamma _H(G)\) is at most 2. Moreover, we determine all the subgroups H and the quotient groups \(\frac{G}{H}\) such that the cross-cap of \(\Gamma _H(G)\) is at most three.

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于有限群幂图的正则子群的属和交盖
设 H 是一个群 G 的正则子群。G 的基于正则子群的幂图(Gamma _H(G))是简单的无向图,其顶点集为(V(\Gamma _H(G))= (G\setminus H)\cup \{e\}),两个不同的顶点 a 和 b 相邻,如果在某个 \(m.)中,要么是(aH = b^m H\ ),要么是(bH=a^nH\ )、n in \mathbb {N}\).在本文中,我们继续研究基于正则子群的幂图,并描述了所有的对 (G, H),其中 H 是 G 的非琐正则子群,使得 \(\Gamma _H(G)\)的属最多为 2。此外,我们确定了所有的子群 H 和商群 \(\frac{G}{H}\),使得 \(\Gamma _H(G)\)的交叉盖最多为 3。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Ricerche di Matematica
Ricerche di Matematica Mathematics-Applied Mathematics
CiteScore
3.00
自引率
8.30%
发文量
61
期刊介绍: “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.
期刊最新文献
Global Hessian estimate for second-order elliptic equation in Hardy spaces Liouville results for stable solutions of weighted elliptic equations involving the Grushin operator Hypercommuting conditions of b-generalized skew derivations on Lie ideals in prime rings Symmetrization results for parabolic equations with a singular lower order term Quotient gamma nearness rings
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1