| 最大Randi(c)指标的k悬挂点化学树的性质 |
| |
| 引用本文： | 吴晓霞,张莲珠.最大Randi(c)指标的k悬挂点化学树的性质[J].数学研究,2008,41(1). |
| |
| 作者姓名： | 吴晓霞 张莲珠 |
| |
| 基金项目： | 国家自然科学基金
,
福建省自然科学基金 |
| |
| 摘 要： | 化学分子图G的Randic指标为R(G)=E(dG(u)dG(v))-(1/2).其中uv是G的边,dG(u)表示G的顶点u的度.本文刻画了具有最大Randic指标的K悬挂点化学树的一些性质.
|
| 关 键 词： | Randic指标 化学树 κ-度悬挂链 Randic index chemical tree κ-degree pendant chain 指标 悬挂点 化学树 性质 Maximal Trees Chemical Properties character properties trees maximal paper degree vertex Abstract index chemical molecule molecular graph |
Properties of Chemical Trees with k Pendant Vertices and Maximal Randi(c) Index |
| |
| Wu Xiaoxia,Zhang Lianzhu.Properties of Chemical Trees with k Pendant Vertices and Maximal Randi(c) Index[J].Journal of Mathematical Study,2008,41(1). |
| |
| Authors: | Wu Xiaoxia Zhang Lianzhu |
| |
| Abstract: | Abstract The Randic index of an chemical molecule whose molecular graph is G is the sum of the weights (dG(u)dG(v))-(1/2) of all edges uv of G, where dG(u) denotes the degree of the vertex u of the molecular graph G. In this paper, we character some properties of chemical trees with k pendant vertices and maximal Randic index. |
| |
| Keywords: | Randic index chemical tree κ-degree pendant chain |
| 本文献已被 万方数据 等数据库收录！ |
