Rongbing Huang, Muhammad Farhan Hanif, Muhammad Kamran Siddiqui, Mazhar Hussain, Muhammad Faisal Hanif
{"title":"论三角形 $$\\gamma$$ -graphyne 网络基于连接数的拓扑指数和熵量","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":"{\"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}","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}
On connection number-based topological indices and entropy measures for triangular $$\gamma$$ -graphyne network
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.