Connective Eccentric Index of an infinite family of linear polycene parallelogram benzenoid

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 the Connective Eccentric index Cξ(G) of graph G are defined as ξ(G)= [wzór] and Cξ(G)=[wzór] where ε(v) is defined as the length of a maximal path connecting a vertex v to another vertex of G. In this present paper, we compute these Eccentric indices for an infinite family of linear polycene parallelogram benzenod by a new method.