دوره 2، شماره 2 - ( 8-1386 )                   جلد 2 شماره 2 صفحات 25-28 | برگشت به فهرست نسخه ها

DOI: 10.7508/ijmsi.2007.02.003


XML Print


چکیده:  

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.

نوع مطالعه: پژوهشي | موضوع مقاله: عمومى