Minimum Detour Index of Tricyclic Graphs

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....

Full description

Bibliographic Details
Main Authors: Wei Fang, Zheng-Qun Cai, Xiao-Xin Li
Format: Article
Language:English
Published: Hindawi Limited 2019-01-01
Series:Journal of Chemistry
Online Access:http://dx.doi.org/10.1155/2019/6031568
id doaj-a6eadd8d02d84fbeb2cc24ddf8fc2f7a
record_format Article
spelling doaj-a6eadd8d02d84fbeb2cc24ddf8fc2f7a2020-11-24T21:36:15ZengHindawi LimitedJournal 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
collection DOAJ
language English
format Article
sources DOAJ
author Wei Fang
Zheng-Qun Cai
Xiao-Xin Li
spellingShingle Wei Fang
Zheng-Qun Cai
Xiao-Xin Li
Minimum Detour Index of Tricyclic Graphs
Journal of Chemistry
author_facet Wei Fang
Zheng-Qun Cai
Xiao-Xin Li
author_sort Wei Fang
title Minimum Detour Index of Tricyclic Graphs
title_short 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_sort minimum detour index of tricyclic graphs
publisher Hindawi Limited
series Journal of Chemistry
issn 2090-9063
2090-9071
publishDate 2019-01-01
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.
url http://dx.doi.org/10.1155/2019/6031568
work_keys_str_mv AT weifang minimumdetourindexoftricyclicgraphs
AT zhengquncai minimumdetourindexoftricyclicgraphs
AT xiaoxinli minimumdetourindexoftricyclicgraphs
_version_ 1725942210455666688

Similar Items