The parameter of a tree -spanner of a graph is always bounded by where is the diameter of the graph. In this paper, we establish a sufficient condition for graphs to have the minimum spanner at least where is the radius. We also obtain a characterization for tree -spanner admissible chordal graphs in terms of tree -spanner admissibility of certain subgraphs.