AU - B. MANOUCHEHRIAN,
AU - A. R. ASHRAFI,
TI - A SIMPLE ALGORITHM FOR COMPUTING DETOUR INDEX OF NANOCLUSTERS
PT - JOURNAL ARTICLE
TA - IJMSI
JN - IJMSI
VO - 2
VI - 2
IP - 2
4099 - http://ijmsi.ir/article-1-21-en.html
4100 - http://ijmsi.ir/article-1-21-en.pdf
SO - IJMSI 2
ABĀ - 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.
CP - IRAN
IN - ACADEMIC CENTER FOR EDUCATION, CULTURE AND RESEARCH, TEHRAN, IRAN
LG - eng
PB - IJMSI
PG - 25
PT - Research paper
YR - 2007