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: | Wei Fang, Zheng-Qun Cai, Xiao-Xin Li |
---|---|
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!
|
Similar Items
-
Gutman Index and Detour Gutman Index of Pseudo-Regular Graphs
by: S. Kavithaa, et al.
Published: (2017-01-01) -
The Connected Detour Numbers of Special Classes of Connected Graphs
by: Ahmed M. Ali, et al.
Published: (2019-01-01) -
Hamilton Connectivity of Convex Polytopes with Applications to Their Detour Index
by: Sakander Hayat, et al.
Published: (2021-01-01) -
Research on Extreme Signed Graphs with Minimal Energy in Tricyclic Signed Graphs S(n, n + 2)
by: Yajing Wang, et al.
Published: (2020-01-01) -
On Minimum Generalized Degree Distance Index of Cyclic Graphs
by: Nadia Khan, et al.
Published: (2023-01-01)