当前位置: X-MOL 学术Complexity › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Algorithms for Computing Wiener Indices of Acyclic and Unicyclic Graphs
Complexity ( IF 2.3 ) Pub Date : 2021-05-03 , DOI: 10.1155/2021/6663306
Bo Bi 1 , Muhammad Kamran Jamil 2 , Khawaja Muhammad Fahd 3 , Tian-Le Sun 4 , Imran Ahmad 5 , Lei Ding 6
Affiliation  

Let be a molecular graph, where and are the sets of vertices (atoms) and edges (bonds). A topological index of a molecular graph is a numerical quantity which helps to predict the chemical/physical properties of the molecules. The Wiener, Wiener polarity, and the terminal Wiener indices are the distance-based topological indices. In this paper, we described a linear time algorithm (LTA) that computes the Wiener index for acyclic graphs and extended this algorithm for unicyclic graphs. The same algorithms are modified to compute the terminal Wiener index and the Wiener polarity index. All these algorithms compute the indices in time .

中文翻译:

无环图和单环图维纳指数的计算算法

是一个分子图,其中和是顶点(原子)和边(键)的集合。分子图的拓扑指数是有助于预测分子的化学/物理性质的数值。维纳,维纳极性和末端维纳指数是基于距离的拓扑指数。在本文中,我们描述了一种线性时间算法(LTA),该算法可为非循环图计算维纳指数,并将该算法扩展为单循环图。修改了相同的算法以计算终端维纳指数和维纳极性指数。所有这些算法都会及时计算指标
更新日期:2021-05-03
down
wechat
bug