| 树按Balaban指标的排序(英文) |
| |
| 引用本文： | 董哈微,郭晓峰.树按Balaban指标的排序(英文)[J].数学研究,2012(3):213-232,309. |
| |
| 作者姓名： | 董哈微 郭晓峰 |
| |
| 作者单位： | 闽江学院数学系;厦门大学数学科学学院 |
| |
| 基金项目： | supported by NSFC(10831001,11171279);YKQ(1009) |
| |
| 摘 要： | 连通图G的Balaban指标(也称J指标)定义为J=J(G)=(|E(G)|)/μ+1∑_(uυ∈E(G)),其中σ_G(u)=∑(w∈V(G)d_G(u,w)此处μ是基圈数.Balaban指标常用于各种QSAR和QSPR的研究.本文根据Balaban指标的计算公式及文中提到的变换方式,我们得到了一些序关系.基于这些序关系,我们确定了n个顶点的树中具有最小Balaban指标的前21个树.
|
| 关 键 词： | 排序 树 Balaban指标 |
Ordering Trees by Balaban Index |
| |
| Dong Hawei,Guo Xiaofeng.Ordering Trees by Balaban Index[J].Journal of Mathematical Study,2012(3):213-232,309. |
| |
| Authors: | Dong Hawei Guo Xiaofeng |
| |
| Institution: | 1.Department of Mathematics,Minjiang University,Fuzhou Pujian 350108 2.School of Mathematical Sciences,Xiamen University,Xiamen Pujian 361005) |
| |
| Abstract: | The Balaban index（also called J index） of a connected graph G is defined as J = J（G） =（|E（G）|/（μ+1））Σuv∈E（G）1/（σG（u）σG（v））1/2,whereσG（u）=∑w∈V（G）dG（u,w） andμis the cyclomatic number of G.Balaban index has been used in various QSAR and QSPR studies.In this paper, we obtained some order relations of trees about Balaban index in the set of n-vertex trees.Based on the order relation,the trees with the first up to at most 21st largest Balaban indices among n-vertex trees are determined. |
| |
| Keywords: | Ordering Tree Balaban index |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
