Abstract. Generalizing a behaviour of Balaban index for double stars we present an interesting convexity property holding for general graphs. Then we demonstrate this property by finding, for each n, seven trees on n vertices with the maximum value of Balaban index.