Let T be a tree. The set of leaves of Τ is denoted by Leaf(Τ). The subtree Τ—Leaf(Τ) of T is called the stem of Τ. A stem is called a k-ended stem if it has at most k-leaves in it. In this paper, we prove the following theorem. Let G be a connected graph and k≥2 be an integer. Let u and ν be a pair of nonadjacent vertices in G. Suppose that |NG(u)∪NG(v)|≥|G|-k-1. Then G has a spanning tree with k-ended stem if and only if G+uv has a spanning tree with k-ended stem. Moreover, the condition on |NG(u)∪NG(v)| is sharp.
 Yamashita T. (2008) Degree Sum and Connectivity Conditions for Dominating Cycles. Discrete Mathematics, 308, 1620-1627.
 Bondy, J.A. and Chvátal, V. (1976) A Mothod in Graph Theory. Discrete Mathematics, 15, 111-135.
 Broersma, H. and Tuinstra, H. (1998) Independence Trees and Hamilton Cycles. Journal of Graph Theory, 29, 227-237.
 Fujisawa, J., Saito, A. and Schiermeyer, I. (2011) Closure for Spanning Trees and Distant Area. Discussiones Mathematicae Graph Theory, 31, 143-159.
 Ozeki, K. and Ya-mashita, T. (2011) Spanning Trees—A Survey. Graphs Combinatorics, 22, 1-26.