|
|
|
|
computing szeged index of graphs on triples
|
|
|
|
|
|
|
|
نویسنده
|
darafsheh m. r. ,modabernia r. ,namdari m.
|
|
منبع
|
iranian journal of mathematical chemistry - 2017 - دوره : 8 - شماره : 2 - صفحه:175 -180
|
|
چکیده
|
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
|
|
آدرس
|
university of tehran, school of mathematics, college of science, ایران, shahid chamran university of ahvaz, department of mathematics, ایران, shahid chamran university of ahvaz, department of mathematics, ایران
|
|
پست الکترونیکی
|
namdari@ipm.ir
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|