Algebraic connectivity and doubly stochastic tree matrices

In this paper, we investigate the relations between the smallest entry of a doubly stochastic tree matrix associated with a tree and the diameter of the tree, which are used to deal with Merris’s conjecture on the algebraic connectivity and the smallest entries. Further, we present a new upper bound for algebraic connectivity in terms of the smallest entry, which improves Merris’ result.