On the feasible tree-diameter sets of graphs

A proof is given for the conjecture on feasible tree-diameter sets of graphs given by Harary et al. [2]. Some additional properties on feasible tree-diameter sets are studied.