首页 | 本学科首页   官方微博 | 高级检索  
     检索      

具有给定悬挂点数目的树的Hosoya指标极值
引用本文:冶成福.具有给定悬挂点数目的树的Hosoya指标极值[J].东北师大学报(自然科学版),2011,43(1):34-39.
作者姓名:冶成福
作者单位:青海师范大学数学与信息科学系;
基金项目:国家自然科学基金资助项目(10761008)
摘    要:具有r个悬挂点的树称为r叶树.研究了具有n个顶点的4叶和5叶树的Hosoya指标值,刻画了具有最大和最小Hosoya指标的5叶树和最小Hosoya指标的4叶树.

关 键 词:Hosorya指标  r叶树  悬挂点

On the extremal Hosoya index with respect to trees having given number of pendent vertices
YE Cheng-fu.On the extremal Hosoya index with respect to trees having given number of pendent vertices[J].Journal of Northeast Normal University (Natural Science Edition),2011,43(1):34-39.
Authors:YE Cheng-fu
Institution:YE Cheng-fu(Department of Mathematics and Information Science,Qinghai Normal University,Xining 810008,China)
Abstract: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.
Keywords:Hosoya index  r-leave tree  pendent vertices  
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号