Maximum Randic index on trees with k-pendant vertices

doi:10.1007/s10910-006-9066-0

CSpace

	Maximum Randic index on trees with k-pendant vertices
	Zhang, Lian-Zhu ; Lu, Mei ; Tian, Feng
	2007-02-01
发表期刊	JOURNAL OF MATHEMATICAL CHEMISTRY
ISSN	0259-9791
卷号	41 期号:2 页码:161-171
摘要	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.
关键词	Randic index tree pendant vertex
DOI	10.1007/s10910-006-9066-0
语种	英语
WOS研究方向	Chemistry ; Mathematics
WOS类目	Chemistry, Multidisciplinary ; Mathematics, Interdisciplinary Applications
WOS记录号	WOS:000244689900006
出版者	SPRINGER
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/4728
专题	中国科学院数学与系统科学研究院
通讯作者	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.