Abstract
Win proved a very famous conclusion that states the graph G with connectivity , independence number and contains a spanning k-ended tree. This means that there exists a spanning tree with at most k leaves. In this paper, we strengthen the Win theorem to the following: Let G be a simple 2-connected graph such that , and the number of maximum independent sets of cardinality is at most . Then, either G contains a spanning k-ended tree or a subgraph of .