Title
Small Randic Index Ordering of Trees with k Pendant Vertices.
Abstract
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) denotes the degree of the vertex u of the molecular graph G. Among all trees with n vertices and k pendant vertices, the extremal trees with the minimum, the second minimum and the third minimum Randic index were characterized by Hansen, Li and Wu et al., respectively. In this paper, we further investigate some small Randic index properties and give other elements of small Randic index ordering of trees with k pendant vertices.
Year
DOI
Venue
2012
null
ARS COMBINATORIA
Keywords
Field
DocType
null
Discrete mathematics,Combinatorics,Vertex (geometry),Natural science,Mathematics
Journal
Volume
Issue
ISSN
103
null
0381-7032
Citations 
PageRank 
References 
0
0.34
0
Authors
2
Name
Order
Citations
PageRank
Xiaoxia Wu153538.61
Lian-Zhu Zhang2339.04