Volume 2, Issue 2 (November 2007)                   IJMSI 2007, 2(2): 25-28 | Back to browse issues page


XML Print


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.

Type of Study: Research paper | Subject: General

Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.