CSpace
The connectivity index
Lu, M; Liu, HQ; Tian, F
2004-04-01
发表期刊MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY
ISSN0340-6253
期号51页码:149-154
摘要Let G be a simple connected graph of order n. The connectivity index R-alpha(G) of a graph G is the sum of the weights (d(u)d(v))(alpha) of all edges uv of G, where alpha is a real number (alpha not equal 0), and d(u) denotes the degree of the vertex u. In this paper, we present some new bounds for the connectivity index of a graph G in terms of the eigenvalues of the Laplacian matrix or adjacency matrix of the graph G, from which we can get some known results.
语种英语
WOS研究方向Chemistry ; Computer Science ; Mathematics
WOS类目Chemistry, Multidisciplinary ; Computer Science, Interdisciplinary Applications ; Mathematics, Interdisciplinary Applications
WOS记录号WOS:000222332700010
出版者UNIV BAYREUTH, DEPT MATHEMATICS
引用统计
文献类型期刊论文
条目标识符http://ir.amss.ac.cn/handle/2S8OKBNM/942
专题中国科学院数学与系统科学研究院
通讯作者Lu, M
作者单位1.Tsing Hua Univ, Dept Math Sci, Beijing 100084, Peoples R China
2.Chinese Acad Sci, Inst Syst Sci, Acad Math & Syst Sci, Beijing 100080, Peoples R China
推荐引用方式
GB/T 7714
Lu, M,Liu, HQ,Tian, F. The connectivity index[J]. MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY,2004(51):149-154.
APA Lu, M,Liu, HQ,&Tian, F.(2004).The connectivity index.MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY(51),149-154.
MLA Lu, M,et al."The connectivity index".MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY .51(2004):149-154.
条目包含的文件
条目无相关文件。
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Lu, M]的文章
[Liu, HQ]的文章
[Tian, F]的文章
百度学术
百度学术中相似的文章
[Lu, M]的文章
[Liu, HQ]的文章
[Tian, F]的文章
必应学术
必应学术中相似的文章
[Lu, M]的文章
[Liu, HQ]的文章
[Tian, F]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。