SHARP BOUNDS FOR THE GENERAL RANDIĆ INDEX OF TREES WITH GIVEN DEGREE SEQUENCES
The general Randić index of a graph G is equal to the sum of the weights of all edges uv in it, where denotes the degree of a vertex u in G and a is an arbitrary real number. In this paper, we completely characterize the unique extremal tree with the maximum general Randić index in the class of all trees with a given degree sequence.
degree sequence, the general Randić index, extremal graphs, tree.
