ON THE SZEGED INDEX AND ITS NON-COMMUTING GRAPH

IF 0.6 Q3 ENGINEERING, MULTIDISCIPLINARY
N. I. Alimon, N. Sarmin, A. Erfanian
{"title":"ON THE SZEGED INDEX AND ITS NON-COMMUTING GRAPH","authors":"N. I. Alimon, N. Sarmin, A. Erfanian","doi":"10.11113/jurnalteknologi.v85.19221","DOIUrl":null,"url":null,"abstract":"In chemistry, the molecular structure can be represented as a graph. Based on the information from the graph, its characterization can be determined by computing the topological index. Topological index is a numerical value that can be computed by using some algorithms and properties of the graph. Meanwhile, the non-commuting graph is a graph, in which two distinct vertices are adjacent if and only if they do not commute, where it is made up of the non-central elements in a group as a vertex set. In this paper, the Szeged index of the non-commuting graph of some finite groups are computed. This paper focuses on three finite groups which are the quasidihedral groups, the dihedral groups, and the generalized quaternion groups. The construction of the graph is done by using Maple software. In finding the Szeged index, some of the previous results and properties of the graph for the quasidihedral groups, the dihedral groups, and the generalized quaternion groups are used. The generalisation of the Szeged index of the non-commuting graph is then established for the aforementioned groups. The results are then applied to find the Szeged index of the non-commuting graph of ammonia molecule.","PeriodicalId":47541,"journal":{"name":"Jurnal Teknologi-Sciences & Engineering","volume":" ","pages":""},"PeriodicalIF":0.6000,"publicationDate":"2023-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Jurnal Teknologi-Sciences & Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.11113/jurnalteknologi.v85.19221","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"ENGINEERING, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

Abstract

In chemistry, the molecular structure can be represented as a graph. Based on the information from the graph, its characterization can be determined by computing the topological index. Topological index is a numerical value that can be computed by using some algorithms and properties of the graph. Meanwhile, the non-commuting graph is a graph, in which two distinct vertices are adjacent if and only if they do not commute, where it is made up of the non-central elements in a group as a vertex set. In this paper, the Szeged index of the non-commuting graph of some finite groups are computed. This paper focuses on three finite groups which are the quasidihedral groups, the dihedral groups, and the generalized quaternion groups. The construction of the graph is done by using Maple software. In finding the Szeged index, some of the previous results and properties of the graph for the quasidihedral groups, the dihedral groups, and the generalized quaternion groups are used. The generalisation of the Szeged index of the non-commuting graph is then established for the aforementioned groups. The results are then applied to find the Szeged index of the non-commuting graph of ammonia molecule.
关于塞格指数及其非交换图
在化学中,分子结构可以用图形表示。根据图中的信息,可以通过计算拓扑指数来确定其特征。拓扑索引是利用图的某些算法和性质可以计算得到的数值。而非交换图是两个不同的顶点当且仅当不交换时相邻的图,由群中的非中心元素组成一个顶点集。本文计算了有限群的非交换图的塞格德指数。本文讨论了拟二面体群、二面体群和广义四元数群这三种有限群。图的构造是用Maple软件完成的。在寻找塞格德指数时,使用了拟二面体群、二面体群和广义四元数群的图的一些先前的结果和性质。然后对上述群建立了非交换图的塞格德指数的泛化。将所得结果应用于求氨分子非交换图的塞格德指数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Jurnal Teknologi-Sciences & Engineering
Jurnal Teknologi-Sciences & Engineering ENGINEERING, MULTIDISCIPLINARY-
CiteScore
1.30
自引率
0.00%
发文量
96
×
引用
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学术官方微信