Connective Eccentric Index of an Infinite Family of Linear Polycene Parallelogram Benzenoid
2014 ◽
Vol 37
◽
pp. 57-62
Keyword(s):
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)dv x ξ(v) and Cξ(G)=ξ(G)= ∑ v∈V(G)dv 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
2014 ◽
Vol 1
(5)
◽
pp. 43-50
2014 ◽
Vol 32
◽
pp. 71-76
2010 ◽
Vol 29
(1)
◽
pp. 71
◽
2018 ◽
Vol 74
(1-2)
◽
pp. 25-33
◽
2014 ◽
Vol 171
◽
pp. 35-41
◽
2012 ◽
Vol 160
(3)
◽
pp. 248-258
◽