Title of article
A SIMPLE ALGORITHM FOR COMPUTING DETOUR INDEX OF NANOCLUSTERS
Author/Authors
MANOOCHEHRIAN، BEHZAD نويسنده ACADEMIC CENTER FOR EDUCATION, CULTURE AND RESEARCH, TEHRAN, IRAN , , ASHRAFI، ALI REZA نويسنده ,
Issue Information
دوفصلنامه با شماره پیاپی سال 2007
Pages
4
From page
25
To page
28
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.
Journal title
Iranian Journal of Mathematical Sciences and Informatics (IJMSI)
Serial Year
2007
Journal title
Iranian Journal of Mathematical Sciences and Informatics (IJMSI)
Record number
1986830
Link To Document