In graph theory, a degree-constrained spanning tree is a spanning tree where the maximum vertex degree is limited to a certain constant k. The degree-constrained spanning tree problem is to determine whether a particular graph has such a spanning tree for a particular k.
Read more about Degree-constrained Spanning Tree: Formal Definition, NP-completeness, Degree-constrained Minimum Spanning Tree, Approximation Algorithm
Famous quotes containing the word tree:
“What I want to say, Linda,
is that there is nothing in your body that lies.
All that is new is telling the truth.
I’m here, that somebody else,
an old tree in the background.”
—Anne Sexton (1928–1974)