 Degree-constrained spanning tree

A degree-constrained spanning tree (DCST) is a specific type of spanning tree in a graph with the additional restriction that the degree (i.e., the number of edges connected) of each vertex must not exceed a specified limit. In other words, a DCST is a tree that spans all the vertices of a graph while ensuring that no vertex has a degree greater than a predefined upper bound.