Algorithms for Computing Wiener Indices of Acyclic and Unicyclic Graphs
Let G=VG,EG be a molecular graph, where VG and EG 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 indice...
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2021-01-01
|
| Series: | Complexity |
| Online Access: | http://dx.doi.org/10.1155/2021/6663306 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832550145308229632 |
|---|---|
| author | Bo Bi Muhammad Kamran Jamil Khawaja Muhammad Fahd Tian-Le Sun Imran Ahmad Lei Ding |
| author_facet | Bo Bi Muhammad Kamran Jamil Khawaja Muhammad Fahd Tian-Le Sun Imran Ahmad Lei Ding |
| author_sort | Bo Bi |
| collection | DOAJ |
| description | Let G=VG,EG be a molecular graph, where VG and EG 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 On. |
| format | Article |
| id | doaj-art-73236002d6b24c03b0683c1c1911c33e |
| institution | Kabale University |
| issn | 1076-2787 1099-0526 |
| language | English |
| publishDate | 2021-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Complexity |
| spelling | doaj-art-73236002d6b24c03b0683c1c1911c33e2025-02-03T06:07:37ZengWileyComplexity1076-27871099-05262021-01-01202110.1155/2021/66633066663306Algorithms for Computing Wiener Indices of Acyclic and Unicyclic GraphsBo Bi0Muhammad Kamran Jamil1Khawaja Muhammad Fahd2Tian-Le Sun3Imran Ahmad4Lei Ding5Maanshan Teacher’s College, Department of Software Engineering, Maanshan 243041, ChinaDepartment of Mathematics, Riphah International University, Lahore, PakistanFAST School of Computing, National University of Computer and Emerging Sciences, Lahore, PakistanCollege of Economics, Sichuan Agricultural University, Chengdu 610000, ChinaFaculty of Computer Science, Riphah International University, Lahore, PakistanSchool of Computer Engineering, Anhui Wenda University of Information Engineering, Hefei 231201, ChinaLet G=VG,EG be a molecular graph, where VG and EG 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 On.http://dx.doi.org/10.1155/2021/6663306 |
| spellingShingle | Bo Bi Muhammad Kamran Jamil Khawaja Muhammad Fahd Tian-Le Sun Imran Ahmad Lei Ding Algorithms for Computing Wiener Indices of Acyclic and Unicyclic Graphs Complexity |
| title | Algorithms for Computing Wiener Indices of Acyclic and Unicyclic Graphs |
| title_full | Algorithms for Computing Wiener Indices of Acyclic and Unicyclic Graphs |
| title_fullStr | Algorithms for Computing Wiener Indices of Acyclic and Unicyclic Graphs |
| title_full_unstemmed | Algorithms for Computing Wiener Indices of Acyclic and Unicyclic Graphs |
| title_short | Algorithms for Computing Wiener Indices of Acyclic and Unicyclic Graphs |
| title_sort | algorithms for computing wiener indices of acyclic and unicyclic graphs |
| url | http://dx.doi.org/10.1155/2021/6663306 |
| work_keys_str_mv | AT bobi algorithmsforcomputingwienerindicesofacyclicandunicyclicgraphs AT muhammadkamranjamil algorithmsforcomputingwienerindicesofacyclicandunicyclicgraphs AT khawajamuhammadfahd algorithmsforcomputingwienerindicesofacyclicandunicyclicgraphs AT tianlesun algorithmsforcomputingwienerindicesofacyclicandunicyclicgraphs AT imranahmad algorithmsforcomputingwienerindicesofacyclicandunicyclicgraphs AT leiding algorithmsforcomputingwienerindicesofacyclicandunicyclicgraphs |