In this paper, we find a tight upper bound on the spectral radius of bottleneck matrices for graphs. We use this upper bound to find a tight lower bound on the algebraic connectivity of graphs in terms of the radius of the graph. We show that these lower bounds are an improvement on those found in[9].