On upper bounds in tree-diameter sets of graphs

An upper bound in tree-diameter sets of connected graphs is given. Let S (a/sub 1/, a/sub 2/, . . ., a/sub n/) be the tree-diameter set of a connected graph G in increasing order. It is proved that a/sub i+1/>