Computing Szeged Index of Graphs on Triples

نویسندگان
Darafsheh, M. R. ID 1
Modabernia, R. ID 2
Namdari, M. ID 3

1 School of Mathematics, College of Science, University of Tehran

2 Department of Mathematics, Shahid Chamran University of Ahvaz

3 Department of Mathematics, Shahid Chamran University of Ahvaz

doi
10.22052/ijmc.2017.80007.1275
چکیده

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.‎

کلیدواژه‌ها
Szeged index‎, Intersection graph‎, Automorphism of graph