具有r个悬挂点的树称为r叶树.研究了具有n个顶点的4叶和5叶树的Hosoya指标值,刻画了具有最大和最小Hosoya指标的5叶树和最小Hosoya指标的4叶树.
A tree is called r-leaves tree if it contains r endvertices.In this paper,it is studied that the Hosoya index value of r-leave and 5-leave tree of order n,and characterize the 5-leave tree with maximal and minimal Hosoya index value,and the 4-leave tree with minimal Hosoya index value.