Computing Szeged Index of Graphs on Triples

Let G=(V,E) be a simple connected graph with vertex set V and edge set E. The Szeged index of G is defined by Sz(G)= {e=uvee nu(e|G)ny(e|G), where nule|G) is the number of vertices of G closer to u than v and n (e|G) can be defined in a similar way. Let S be a set of size n > 8 and V be the set of all subsets of S of size 3. We define three types of intersection graphs with vertex set V. These graphs are denoted by Gi(n), i=0,1,2 and we will find their Szeged indices.