On numbers of vertices of maximum degree in the spanning trees of a graph

For a connected graph G, let script T sign(G) be the set of all spanning trees of G and let nΔ(G) be the number of vertices of maximum degree in G. In this paper we show that if G is a cactus or a connected graph with p vertices and p+1 edges, then the set {nΔ(T) : T is a member of the set of script T sign(G)} has at most one gap, that is, it is a set of consecutive integers or it is the union of two sets each of which consists of consecutive integers.