Abstract. We correct some previous results and solve a conjecture regarding the ratio of Balaban and Randic indices. Next, we prove that for every k and n sufficiently large the first k graphs of order n with the largest value of Balaban index are trees. Finally, we give a result about the accumulation points of sum-Balaban index.