Minimum Detour Index of Tricyclic Graphs
The detour index of a connected graph is defined as the sum of the detour distances (lengths of longest paths) between unordered pairs of vertices of the graph. The detour index is used in various quantitative structure-property relationship and quantitative structure-activity relationship studies....
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2019-01-01
|
| Series: | Journal of Chemistry |
| Online Access: | http://dx.doi.org/10.1155/2019/6031568 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832552243148095488 |
|---|---|
| author | Wei Fang Zheng-Qun Cai Xiao-Xin Li |
| author_facet | Wei Fang Zheng-Qun Cai Xiao-Xin Li |
| author_sort | Wei Fang |
| collection | DOAJ |
| description | The detour index of a connected graph is defined as the sum of the detour distances (lengths of longest paths) between unordered pairs of vertices of the graph. The detour index is used in various quantitative structure-property relationship and quantitative structure-activity relationship studies. In this paper, we characterize the minimum detour index among all tricyclic graphs, which attain the bounds. |
| format | Article |
| id | doaj-art-a6eadd8d02d84fbeb2cc24ddf8fc2f7a |
| institution | Kabale University |
| issn | 2090-9063 2090-9071 |
| language | English |
| publishDate | 2019-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Journal of Chemistry |
| spelling | doaj-art-a6eadd8d02d84fbeb2cc24ddf8fc2f7a2025-02-03T05:59:18ZengWileyJournal of Chemistry2090-90632090-90712019-01-01201910.1155/2019/60315686031568Minimum Detour Index of Tricyclic GraphsWei Fang0Zheng-Qun Cai1Xiao-Xin Li2School of Mathematical Sciences, Anhui University, Hefei 230601, ChinaSchool of Foreign Studies, Anhui Jianzhu University, Hefei 230601, ChinaSchool of Big Data and Artificial Intelligence, Chizhou University, Chizhou 247000, ChinaThe detour index of a connected graph is defined as the sum of the detour distances (lengths of longest paths) between unordered pairs of vertices of the graph. The detour index is used in various quantitative structure-property relationship and quantitative structure-activity relationship studies. In this paper, we characterize the minimum detour index among all tricyclic graphs, which attain the bounds.http://dx.doi.org/10.1155/2019/6031568 |
| spellingShingle | Wei Fang Zheng-Qun Cai Xiao-Xin Li Minimum Detour Index of Tricyclic Graphs Journal of Chemistry |
| title | Minimum Detour Index of Tricyclic Graphs |
| title_full | Minimum Detour Index of Tricyclic Graphs |
| title_fullStr | Minimum Detour Index of Tricyclic Graphs |
| title_full_unstemmed | Minimum Detour Index of Tricyclic Graphs |
| title_short | Minimum Detour Index of Tricyclic Graphs |
| title_sort | minimum detour index of tricyclic graphs |
| url | http://dx.doi.org/10.1155/2019/6031568 |
| work_keys_str_mv | AT weifang minimumdetourindexoftricyclicgraphs AT zhengquncai minimumdetourindexoftricyclicgraphs AT xiaoxinli minimumdetourindexoftricyclicgraphs |