树按Balaban指标的排序(英文)  

Ordering Trees by Balaban Index

作　　者：董哈微[1] 郭晓峰[2] 

机构地区：[1]闽江学院数学系,福建福州350108 [2]厦门大学数学科学学院,福建厦门361005

出　　处：《数学研究》2012年第3期213-232,309,共21页Journal of Mathematical Study

基　　金：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个树.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.

关 键 词：排序 树 Balaban指标 

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