unicyclic graphs with maximum randić indices

The randi'c index r(g) of a graph g is the sum of the weights (dudv)^−1/2 of all edges uv in g, where du denotes the degree of vertex u. du and zhou [on randi'c indices of trees, unicyclic graphs, and bicyclic graphs, int. j. quantum chem. 111 (2011), 2760--2770] determined the n-vertex unicyclic graphs with the third for n≥5, the fourth for n≥7 and the fifth for n≥8 maximum randi'c indices. recently, li et al. [the randi{' c} indices of trees, unicyclic graphs and bicyclic graphs, ars combin. 127 (2016), 409--419] obtained the n-vertex unicyclic graphs with the sixth and the seventh for n≥9 and the eighth for n≥10 maximum randi'c indices. in this paper, we characterize the n-vertex unicyclic graphs with the ninth, the tenth, the eleventh, the twelfth and the thirteenth maximum randi'c values.