非交换图为分裂图的群

IF 0.7 Q2 MATHEMATICS
M. Akbari, A. Moghaddamfar
{"title":"非交换图为分裂图的群","authors":"M. Akbari, A. Moghaddamfar","doi":"10.22108/IJGT.2017.11161","DOIUrl":null,"url":null,"abstract":"The noncommuting graph $nabla (G)$ of a group $G$ is a simple graph whose vertex set is the set of noncentral elements of $G$ and the edges of which are the ones connecting two noncommuting elements. We determine here, up to isomorphism, the structure of any finite nonabeilan group $G$ whose noncommuting graph is a split graph, that is, a graph whose vertex set can be partitioned into two sets such that the induced subgraph on one of them is a complete graph and the induced subgraph on the other is an independent set.","PeriodicalId":43007,"journal":{"name":"International Journal of Group Theory","volume":null,"pages":null},"PeriodicalIF":0.7000,"publicationDate":"2017-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Groups for which the noncommuting graph is a split graph\",\"authors\":\"M. Akbari, A. Moghaddamfar\",\"doi\":\"10.22108/IJGT.2017.11161\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The noncommuting graph $nabla (G)$ of a group $G$ is a simple graph whose vertex set is the set of noncentral elements of $G$ and the edges of which are the ones connecting two noncommuting elements. We determine here, up to isomorphism, the structure of any finite nonabeilan group $G$ whose noncommuting graph is a split graph, that is, a graph whose vertex set can be partitioned into two sets such that the induced subgraph on one of them is a complete graph and the induced subgraph on the other is an independent set.\",\"PeriodicalId\":43007,\"journal\":{\"name\":\"International Journal of Group Theory\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2017-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Group Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.22108/IJGT.2017.11161\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Group Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.22108/IJGT.2017.11161","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 4

摘要

群$G$的非交换图$nabla (G)$是一个简单图,其顶点集是$G$的非中心元素的集合,其边是连接两个非交换元素的边。在同构范围内,我们确定了任意有限非阿贝兰群$G$的结构,其非交换图是一个分裂图,即其顶点集可以划分为两个集合,其中一个集合上的诱导子图是完全图,另一个集合上的诱导子图是独立集。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Groups for which the noncommuting graph is a split graph
The noncommuting graph $nabla (G)$ of a group $G$ is a simple graph whose vertex set is the set of noncentral elements of $G$ and the edges of which are the ones connecting two noncommuting elements. We determine here, up to isomorphism, the structure of any finite nonabeilan group $G$ whose noncommuting graph is a split graph, that is, a graph whose vertex set can be partitioned into two sets such that the induced subgraph on one of them is a complete graph and the induced subgraph on the other is an independent set.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
0.90
自引率
0.00%
发文量
1
审稿时长
30 weeks
期刊介绍: International Journal of Group Theory (IJGT) is an international mathematical journal founded in 2011. IJGT carries original research articles in the field of group theory, a branch of algebra. IJGT aims to reflect the latest developments in group theory and promote international academic exchanges.
×
引用
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学术官方微信