The Smallest Randić Index for Trees

Proceedings Mathematical Sciences

Liu Weijun¹  Li Bingjun² 

[1] College of Mathematics, Central South University, Changsha 0000, China$$;Department of Mathematics, Hunan Institute of Humanities, Science and Technology, Loudi City, Hunan 000, China$$

关键词: Extremal graph;    tree;    the general Randic index.;   

DOI  :  

学科分类：数学（综合）

来源: Indian Academy of Sciences

【 摘 要 】

The general Randic index Rα(G) is the sum of the weight d(u)d(v)α over all edges uv of a graph G, where α is a real number and d(u) is the degree of the vertex u of G. In this paper, for any real number α=0, the first three minimum general Randic indices among trees are determined, and the corresponding extremal trees are characterized.

【 授权许可】

Unknown