|本期目录/Table of Contents|

给定最大匹配数的树的零阶广义Randi?c 指标(PDF)

《纯粹数学与应用数学》[ISSN:1008-5513/CN:61-1240/O1]

期数:
2010年02期
页码:
339-344
栏目:
出版日期:
2010-04-25

文章信息/Info

Title:
Extremal trees with repected to zeroth-order general Randi?c index
作者:
林启法1 钱建国2
(1. 宁德师范高等专科学校数学系, 福建宁德352100; 2. 厦门大学数学科学学院, 福建厦门361005)
Author(s):
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)
关键词:
零阶广义Randi?c 指标 最大匹配数
Keywords:
tree zeroth-order general Randi?c index maximum matching
分类号:
O157.5
DOI:
-
文献标识码:
A
摘要:
图G 的零阶广义Randi?c 指标定义为0R?(G) = P v2V (G) d(v)?; 其中d(v) 为 图G 的顶点v 的度,? 为任意实数. 研究了树的零阶广义R? 指标的极值问题, 利用分 析和图的理论, 确定了任意给定最大匹配数的树的最大和最小R? 的值,并刻画了达到 该极值的树.
Abstract:
The zeroth-order general Randi?c index of a graph G is deˉned by 0R?(G) = P v2V (G) d(v)?; where ? 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.

参考文献/References

-

备注/Memo

备注/Memo:
-
更新日期/Last Update: 2010-06-02