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

给定最大匹配数的树的零阶广义Randid(c)指标
引用本文:林启法,钱建国.给定最大匹配数的树的零阶广义Randid(c)指标[J].纯粹数学与应用数学,2010,26(2):339-344.
作者姓名:林启法  钱建国
作者单位:宁德师范高等专科学校数学系,福建,宁德,352100;厦门大学数学科学学院,福建,厦门,361005
基金项目:国家自然科学基金,福建省教育厅科技项目,宁德师范高等专科学校科研项目 
摘    要:图G的零阶广义Randi指标定义为0Rα(G)=v∈V(G)d(v)α,其中d(v)为图G的顶点v的度,α为任意实数.研究了树的零阶广义Rα指标的极值问题,利用分析和图的理论,确定了任意给定最大匹配数的树的最大和最小Rα的值,并刻画了达到该极值的树.

关 键 词:  零阶广义Randi(c)指标  最大匹配数

Extremal trees with repected to zeroth-order general Randi(c) index
LIN Qi-fa ,QIAN Jian-guo.Extremal trees with repected to zeroth-order general Randi(c) index[J].Pure and Applied Mathematics,2010,26(2):339-344.
Authors:LIN Qi-fa  QIAN Jian-guo
Institution:LIN Qi-fa 1,QIAN Jian-guo 2(1.Department of Mathematics,Ningde Teachers College,Ningde 352100,China,2.School of Mathematical Sciences,Xiamen University,Xiamen 361005,China)
Abstract:The zeroth-order general Randic index of a graph G is defined by ~0R_α (G)=∑_(v∈V(G))d(v)~α, where a is a real number and d(v) is the degree of v. In this paper, an upper bound and a lower bound for the trees with given size of the maximum matching are determined, respectively. Further, the corresponding extremal trees are characterized.
Keywords:tree  zeroth-order general Randic index  maximum matching
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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