عنوان المقالة:Eccentric connectivity index of chemical trees
عبد الجليل منشد خلف | Abdul Jalil M. Khalaf | 3165
- نوع النشر
- مؤتمر علمي
- المؤلفون بالعربي
- RS Haoer, KA Atan, AM Khalaf, MR Md Said, R Hasni
- الملخص العربي
- Let G = (V, E) be a simple connected molecular graph. In such a simple molecular graph, vertices and edges are depicted atoms and chemical bonds respectively, we refer to the sets of vertices by V (G) and edges by E (G). If d(u, v) be distance between two vertices u, v ∈ V(G) and can be defined as the length of a shortest path joining them. Then, the eccentricity connectivity index (ECI) of a molecular graph G is ξ(G) = ∑v∈V(G) d(v) ec(v), where d(v) is degree of a vertex v ∈ V(G). ec(v) is the length of a greatest path linking to another vertex of v. In this study, we focus the general formula for the eccentricity connectivity index (ECI) of some chemical trees as alkenes.
- تاريخ النشر
- 01/06/2016
- الناشر
- AIP Conference Proceedings
- رابط DOI
- 10.1063/1.
- رابط الملف
- تحميل (166 مرات التحميل)
- رابط خارجي
- http://dx.doi.org/10.1063/1.4952523
- الكلمات المفتاحية
- Eccentric Connectivity Index, Chemical Trees