LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

Minimum Detour Index of Tricyclic Graphs

Photo by stonedrake33148 from unsplash

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… Click to show full abstract

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.

Keywords: detour index; index; tricyclic graphs; index tricyclic; minimum detour

Journal Title: Journal of Chemistry
Year Published: 2019

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.