|
|
|
|
degree distance and gutman index of increasing trees
|
|
|
|
|
|
|
|
نویسنده
|
kazemi ramin ,khaleghi meimondari leila
|
|
منبع
|
transactions on combinatorics - 2016 - دوره : 5 - شماره : 2 - صفحه:23 -31
|
|
چکیده
|
The gutman index and degree distance of a connected graph gg are defined as gut(g)=∑{u,v}⊆v(g)d(u)d(v)dg(u,v), and dd(g)=∑{u,v}⊆v(g)(d(u)+d(v))dg(u,v), respectively, where d(u) is the degree of vertex uu and dg(u,v) is the distance between vertices u and v. in this paper, through a recurrence equation for the wiener index, we study the first two moments of the gutman index and degree distance of increasing trees.
|
|
کلیدواژه
|
increasing trees; the wiener index; the gutman index; degree distance
|
|
آدرس
|
imam khomeini international university, department of statistics, ایران, imam khomeini international university, department of statistics, ایران
|
|
پست الکترونیکی
|
le.khaleghi@gmail.com
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|