The smallest randić index for trees

Authors:
Bingjun Li;Weijun Liu
Affiliations:
College of Mathematics, Central South University, Changsha, China,Department of Mathematics, Hunan Institute of Humanities Science and Technology, Loudi city, Hunan, China;College of Mathematics, Central South University, Changsha, China,Department of Mathematics, Hunan Institute of Humanities Science and Technology, Loudi city, Hunan, China
Venue:
WISM'12 Proceedings of the 2012 international conference on Web Information Systems and Mining
Year:
2012

Citing 2
Cited 0

Graph Theory With Applications

Graph Theory With Applications
Brief Communication: Graphs with maximum connectivity index

Computational Biology and Chemistry

Quantified Score

Hi-index	0.00

Visualization

Abstract

The general Randić 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 Randić indices among trees are determined, and the corresponding extremal trees are characterized.