A SIMPLE ALGORITHM FOR COMPUTING DETOUR INDEX OF NANOCLUSTERS

Author(s):

B. Manouchehrian , A. R. Ashrafi

Abstract:
Let G be the chemical graph of a molecule. The matrix D = [dij] is called the detour matrix of G, if dij is the length of longest path between atoms i and j. The sum of all entries above the main diagonal of D is called the detour index of G. In this paper, a new algorithm for computing the detour index of molecular graphs is presented. We apply our algorithm on copper and silver nanoclusters to find their detour index.
Language:
English
Published:
Iranian Journal of Mathematical Sciences and Informatics, Volume:2 Issue: 2, Nov 2007
Page:
25
https://www.magiran.com/p646873