Citation
Haoer, Raad Sehen and Mohd Atan, Kamel Ariffin and Khalaf, Abdul Jalil Manshad and Md. Said, Mohamad Rushdan and Hasni @ Abdullah, Roslan
(2016)
Eccentric connectivity index of chemical trees.
In: 2nd International Conference on Mathematical Sciences and Statistics (ICMSS2016), 26-28 Jan. 2016, Kuala Lumpur, Malaysia. (pp. 1-6).
Abstract
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.
Download File
Additional Metadata
Actions (login required)
 |
View Item |
