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



DOI: 10.7508/ijmsi.2007.02.003

XML Print


Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

B. MANOUCHEHRIAN, A. R. ASHRAFI. A SIMPLE ALGORITHM FOR COMPUTING DETOUR INDEX OF NANOCLUSTERS. IJMSI. 2007; 2 (2) :25-28
URL: http://ijmsi.ir/article-1-21-en.html

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 | Subject: General

Add your comments about this article : Your username or Email:
Write the security code in the box

© 2015 All Rights Reserved | Iranian Journal of Mathematical Sciences and Informatics

Designed & Developed by : Yektaweb