Let G=(V, E) be a graph, where V(G) is a non-empty set of vertices and E(G) is a set of edges.We defined dv denote the degree of vertex v∈V(G). The Eccentric Connectivity index ξ(G) and theConnective Eccentric index Cξ(G) of graph G are defined as ξ(G)= ∑_{ v∈V(G)}d_{v} x ξ(v) and Cξ(G)=ξ(G)= ∑_{ v∈V(G)}d_{v} x ξ(v)^{-} where ε(v)^{} is defined as the length of a maximal path connecting a vertex v toanother vertex of G. In this present paper, we compute these Eccentric indices for an infinite family oflinear polycene parallelogram benzenod by a new method.Keywords: Molecular graphs; Linear polycene parallelogram; Benzenoid; Eccentric connectivityindex; Connective eccentric index

Periodical:

International Letters of Chemistry, Physics and Astronomy (Volume 37)

Pages:

57-62

DOI:

10.18052/www.scipress.com/ILCPA.37.57

Citation:

M. R. Farahani "Connective Eccentric Index of an Infinite Family of Linear Polycene Parallelogram Benzenoid", International Letters of Chemistry, Physics and Astronomy, Vol. 37, pp. 57-62, 2014

Online since:

Aug 2014

Authors:

Keywords:

Distribution:

Open Access

This work is licensed under a

Creative Commons Attribution 4.0 International License