Document Type: Research Paper
School of Mathematics, College of Science, University of Tehran
Department of Mathematics, Shahid Chamran University of Ahvaz
ABSTRACT 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 where respectively is the number of vertices of G closer to u (respectively v) than v (respectively u).
If S is a set of size let V be the set of all subsets of S of size 3. Then we define three types of intersection graphs with vertex set V. These graphs are denoted by and we will find their Szeged indices.