Citation
Abstract
Let G = (V, E) be a simple connected molecular graph. In such a simple molecular graph, vertices represent atoms and edges represent chemical bonds, we denoted the sets of vertices and edges by V(G) and E(G), respectively. If d(u, v) be the notation of distance between vertices u, v ε V(G) and is defined as the length of a shortest path connecting them. Then, the eccentricity connectivity index of a molecular graph G is defined as ζ(G) = Σ vεv(G) deg(v)ec(v), where deg(v) is degree of a vertex v ε V(G), and is defined as the number of adjacent vertices with v. ec(v) is eccentricity of a vertex v ε V(G), and 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 some classes of chemical trees.
Download File
Official URL or Download Paper: http://www.ijpam.eu/contents/20161061/12/12.pdf

Additional Metadata
Item Type:  Article 

Divisions:  Faculty of Computer Science and Information Technology Institute for Mathematical Research 
DOI Number:  https://doi.org/10.12732/ijpam.v106i1.12 
Publisher:  Academic Publications 
Keywords:  Eccentric connectivity index; Eccentricity; Chemical trees 
Depositing User:  Mohd Hafiz Che Mahasan 
Date Deposited:  14 Aug 2017 03:49 
Last Modified:  14 Aug 2017 03:49 
Altmetrics:  http://www.altmetric.com/details.php?domain=psasir.upm.edu.my&doi=10.12732/ijpam.v106i1.12 
URI:  http://psasir.upm.edu.my/id/eprint/55583 
Statistic Details:  View Download Statistic 
Actions (login required)
View Item 