Abstract: In this paper, it is shown that if a simple connected graph G contains spanning trees having m and n end-vertices respectively and m<n, then for any integer k, m<k<n, G contains, at least, ρ+ spanning trees having k end-vertices where ρ is the circuit rank of G.