具有给定悬挂点数目的树的独立指数的最大小值  

The maximum and minimum values of the independent indices of trees with given a number of pendent vertices

作　　者：曹庆信[1] 陈祥恩[1] 苏克义[1] 

机构地区：[1]西北师范大学数学与信息科学学院,甘肃兰州730070

出　　处：《山东大学学报（理学版）》2009年第4期31-36,共6页Journal of Shandong University(Natural Science)

基　　金：国家自然科学基金资助项目(10771091);甘肃省教育厅科研项目(0501-02)

摘　　要：具有r个悬挂点的树称为r叶树。研究具有n个顶点的3叶,4叶树的独立指数的最大小值,刻画了具有最大,最小独立指数的3叶,4叶树。A tree is called an r-leaves tree if it has r pendent vertices. The maximum and minimum values of the independent indices of 3-leaves trees and 4-leaves trees are investigated. 3-leaves and 4-leaves trees, which have the maximum or minimum values of the independent indices, are characterized.

关 键 词：独立指数 r叶树 悬挂点 

分 类 号：O157.5[理学—数学]