一种高效的细谷索引算法及其应用

Int. J. Comput. Aided Eng. Technol. Pub Date : 2019-03-07 DOI:10.1504/IJCAET.2019.098172

P. Manuel

{"title":"一种高效的细谷索引算法及其应用","authors":"P. Manuel","doi":"10.1504/IJCAET.2019.098172","DOIUrl":null,"url":null,"abstract":"The number of matching's in a graph is known as the Hosoya index of the graph. The problem of computing Hosoya index is #P-complete. If the adjacent edges are sequentially ordered, then we show that a polynomial algorithm can be designed. The significance of this algorithm is demonstrated by computing Hosoya index for certain chemical compounds such as Pyroxene. This algorithm can be applied to grid like chemical compounds such as sodium chloride, carbon nanotubes, naphtalenic nanotube etc.","PeriodicalId":346646,"journal":{"name":"Int. J. Comput. Aided Eng. Technol.","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"An efficient Hosoya index algorithm and its application\",\"authors\":\"P. Manuel\",\"doi\":\"10.1504/IJCAET.2019.098172\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The number of matching's in a graph is known as the Hosoya index of the graph. The problem of computing Hosoya index is #P-complete. If the adjacent edges are sequentially ordered, then we show that a polynomial algorithm can be designed. The significance of this algorithm is demonstrated by computing Hosoya index for certain chemical compounds such as Pyroxene. This algorithm can be applied to grid like chemical compounds such as sodium chloride, carbon nanotubes, naphtalenic nanotube etc.\",\"PeriodicalId\":346646,\"journal\":{\"name\":\"Int. J. Comput. Aided Eng. Technol.\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-03-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Int. J. Comput. Aided Eng. Technol.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1504/IJCAET.2019.098172\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Comput. Aided Eng. Technol.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/IJCAET.2019.098172","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

图中匹配的数量称为图的细谷指数。细谷指数的计算问题是# p -完备的。如果相邻边是顺序排列的，那么我们证明了可以设计一个多项式算法。通过计算某些化合物(如辉石)的细谷指数，证明了该算法的意义。该算法可应用于网格状化合物，如氯化钠、碳纳米管、萘纳米管等。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

An efficient Hosoya index algorithm and its application

The number of matching's in a graph is known as the Hosoya index of the graph. The problem of computing Hosoya index is #P-complete. If the adjacent edges are sequentially ordered, then we show that a polynomial algorithm can be designed. The significance of this algorithm is demonstrated by computing Hosoya index for certain chemical compounds such as Pyroxene. This algorithm can be applied to grid like chemical compounds such as sodium chloride, carbon nanotubes, naphtalenic nanotube etc.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Int. J. Comput. Aided Eng. Technol.

自引率

0.00%

发文量