Computing Szeged Index of Certain Nanosheets Using Partition Technique

Abstract

Distance properties of molecular graphs form an important topic in chemical graph theory. The Szeged index is a molecular structure descriptor equal to the sum of products neu(e|G) · nev(e|G) over all edges e =( uv) of the molecular graph G, where neu(e|G )i s the number of vertices whose distance to vertexu is smaller than the distance to vertex v ,a nd wherenev(e|G) is defined analogously. In this paper we compute the Szeged index of certain chemical graphs without using distance matrix.