中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
Maximum Randic index on trees with k-pendant vertices

文献类型:期刊论文

作者Zhang, Lian-Zhu; Lu, Mei; Tian, Feng
刊名JOURNAL OF MATHEMATICAL CHEMISTRY
出版日期2007-02-01
卷号41期号:2页码:161-171
关键词Randic index tree pendant vertex
ISSN号0259-9791
DOI10.1007/s10910-006-9066-0
英文摘要The Randic index of an organic molecule whose molecular graph is G is the sum of the weights (d(u) d(v))(-1/2) of all edges uv of G, where d(u) and d(v) are the degrees of the vertices u and v in G. Let T be a tree with n vertices and k pendant vertices. In this paper, we give a sharp upper bound on Randic index of T.
WOS研究方向Chemistry ; Mathematics
语种英语
WOS记录号WOS:000244689900006
出版者SPRINGER
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/4727]  
专题中国科学院数学与系统科学研究院
通讯作者Zhang, Lian-Zhu
作者单位1.Xiamen Univ, Sch Math Sci, Xiamen 361005, Fujian, Peoples R China
2.Tsing Hua Univ, Dept Math Sci, Beijing 100084, Peoples R China
3.Chinese Acad Sci, Acad Math & Syst Sci, Inst Syst Sci, Beijing 100080, Peoples R China
推荐引用方式
GB/T 7714
Zhang, Lian-Zhu,Lu, Mei,Tian, Feng. Maximum Randic index on trees with k-pendant vertices[J]. JOURNAL OF MATHEMATICAL CHEMISTRY,2007,41(2):161-171.
APA Zhang, Lian-Zhu,Lu, Mei,&Tian, Feng.(2007).Maximum Randic index on trees with k-pendant vertices.JOURNAL OF MATHEMATICAL CHEMISTRY,41(2),161-171.
MLA Zhang, Lian-Zhu,et al."Maximum Randic index on trees with k-pendant vertices".JOURNAL OF MATHEMATICAL CHEMISTRY 41.2(2007):161-171.

入库方式: OAI收割

来源:数学与系统科学研究院

浏览0
下载0
收藏0
其他版本

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