UPM Institutional Repository

Eccentric connectivity index of chemical trees


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).


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

PDF (Abstract)
Eccentric connectivity index of chemical trees.pdf

Download (95kB) | Preview

Additional Metadata

Item Type: Conference or Workshop Item (Paper)
Divisions: Institute for Mathematical Research
DOI Number: https://doi.org/10.1063/1.4952523
Publisher: AIP Publishing
Keywords: Chemical trees
Depositing User: Mohd Hafiz Che Mahasan
Date Deposited: 14 Aug 2017 03:49
Last Modified: 17 Oct 2017 10:15
Altmetrics: http://www.altmetric.com/details.php?domain=psasir.upm.edu.my&doi=10.1063/1.4952523
URI: http://psasir.upm.edu.my/id/eprint/55582
Statistic Details: View Download Statistic

Actions (login required)

View Item View Item