The(Weighted)Mostar Index of Tree with Given Maximum Degree
Given a connected graph G,the Mostar index is defined as Mo(G)=∑e=uv ∈ EG|nu(e)-nv(e)|,the additively weighted Mo-star index is defined as w+Mo(G)=∑e=uv ∈ EG(dG(u)+dG(v))|nu(e)-nv(e)|,the Multiplicatively weighted Mostar index is defined as w* Mo(G)=∑e=uv ∈ EG(dG(u)·dG(v))|nu(e)-nv(e)|.By transformation and calculation,the lower bound of Mostar index,addi-tively weighted Mostar index and multiplicatively weighted Mostar index of tree with given maximum degree are obtained,and the extre-mal graph is depicted.
NETL
NSTL
万方数据
