R. S. Haoer, K. A. Atan, A. M. Khalaf, M. R. Md. Said, R. Hasni
الملخص العربي
Let G = (V,E) be a simple connected molecular graph. The eccentric connectivity index ξ(G) is a distance–based molecular structure descriptor that was recently used for mathematical modelling of biological activities of diverse nature. In such a simple molecular graph, vertices represent atoms and edges represent chemical bonds, we denoted the sets of vertices and edges by V = V(G) and E = E(G), respectively. If d(u,v) be the notation of distance between vertices u,v ∈ V and is defined as the length of a shortest path connecting them. Then, the eccentricity connectivity index of a molecular graph Gis defined as ξ(G) = Σ v ∈V(G) deg(V)ec(V), where deg(V) (or simply dv ) is degree of a vertex V ∈ V(G), and is defined as the number of adjacent vertices with V. ec(V) is defined as the length of a maximal path connecting to another vertex of v. In this paper, we establish the general formulas for the eccentricity connectivity index of molecular graphs classes of chemical trees with application to alkynes.
تاريخ النشر
01/10/2016
الناشر
Journal of Computational and Theoretical Nanoscience
عبد الجليل منشد خلف | Abdul Jalil M. Khalaf | 3165