On connection number-based topological indices and entropy measures for triangular $$\gamma$$ -graphyne network

Rongbing Huang, Muhammad Farhan Hanif, Muhammad Kamran Siddiqui, Mazhar Hussain, Muhammad Faisal Hanif
{"title":"On connection number-based topological indices and entropy measures for triangular $$\\gamma$$ -graphyne network","authors":"Rongbing Huang, Muhammad Farhan Hanif, Muhammad Kamran Siddiqui, Mazhar Hussain, Muhammad Faisal Hanif","doi":"10.1007/s11227-024-06398-x","DOIUrl":null,"url":null,"abstract":"<p>Triangular <span>\\(\\gamma\\)</span>-graphyne has a special carbon–carbon bonding arrangement, which results in outstanding electrical characteristics. It is a potential material for semiconductors and conductors in nanoelectronic devices. The number of vertices at a distance of 2 from a vertex is known as the connection number (CN) of that vertex. In this paper, we computed Zagreb-type indices based on connection numbers. In order to give us a better knowledge of the structural properties of molecules or networks, these indices are calculated. Following the computation of these indices, we investigated their use in computing entropy, providing important new information about the thermodynamic characteristics and complexity of the understudied systems. We used Python language to find the Pearson correlation coefficient between indices and entropy and show its heat map.\n</p>","PeriodicalId":501596,"journal":{"name":"The Journal of Supercomputing","volume":"15 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"The Journal of Supercomputing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s11227-024-06398-x","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Triangular \(\gamma\)-graphyne has a special carbon–carbon bonding arrangement, which results in outstanding electrical characteristics. It is a potential material for semiconductors and conductors in nanoelectronic devices. The number of vertices at a distance of 2 from a vertex is known as the connection number (CN) of that vertex. In this paper, we computed Zagreb-type indices based on connection numbers. In order to give us a better knowledge of the structural properties of molecules or networks, these indices are calculated. Following the computation of these indices, we investigated their use in computing entropy, providing important new information about the thermodynamic characteristics and complexity of the understudied systems. We used Python language to find the Pearson correlation coefficient between indices and entropy and show its heat map.

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
论三角形 $$\gamma$$ -graphyne 网络基于连接数的拓扑指数和熵量
三角形石墨烯具有特殊的碳-碳键排列,因而具有出色的电气特性。它是纳米电子器件中一种潜在的半导体和导体材料。与顶点距离为 2 的顶点数称为该顶点的连接数(CN)。在本文中,我们计算了基于连接数的萨格勒布型指数。为了让我们更好地了解分子或网络的结构特性,我们计算了这些指数。在计算出这些指数后,我们研究了它们在计算熵中的应用,从而提供了有关未被充分研究的系统的热力学特性和复杂性的重要新信息。我们使用 Python 语言找到了指数与熵之间的皮尔逊相关系数,并展示了其热图。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A quadratic regression model to quantify certain latest corona treatment drug molecules based on coindices of M-polynomial Data integration from traditional to big data: main features and comparisons of ETL approaches End-to-end probability analysis method for multi-core distributed systems A cloud computing approach to superscale colored traveling salesman problems Approximating neural distinguishers using differential-linear imbalance
×
引用
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