شماره ركورد كنفرانس :
5263
عنوان مقاله :
Wiener Complexity and Mostar Index in Trees
پديدآورندگان :
Alizadeh Yaser y.alizadeh@hsu.ac.ir Department of Mathematics, Hakim Sabzevari University, Sabzvar, Iran , Mohammadpoor Zohreh mohamadpoor.z@gmail.com Department of Mathematics, Hakim Sabzevari University, Sabzevar, Iran
كليدواژه :
transmission of vertex , Wiener complexity , Wiener index , Mostar index
عنوان كنفرانس :
54 امين كنفرانس رياضي ايران
چكيده فارسي :
Let G be a simple connected graph. For a vertex u, transmission TrG(u) is defined as sum of all distances between u and other vertices. Wiener index of G is sum of distances between all pair of vertices which equals half of sum of transmission of vertices. Wiener complexity is number of different vertex transmission of G . In this paper we study Mostar index on trees with given Wiener complexity.
