Algorithms for Computing Wiener Indices of Acyclic and Unicyclic Graphs

DOI10.1155/2021/6663306MaRDI QIDQ6296527zbMATH OpenFDO

Authors Bo Bi, Muhammad Jamil, Khawaja Muhammad Fahd, Tian-Le Sun, Imran Ahmad, Lei Ding

Publication date 16 January 2018

Full work available at URL https://doi.org/10.1155/2021/6663306

Abstract: Let $G=(V(G),E(G))$ be a molecular graph, where $V(G)$ and $E(G)$ 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 {�f(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 $O(n)$.

This page was built for publication: Algorithms for Computing Wiener Indices of Acyclic and Unicyclic Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6296527)