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:
“a big picture of K. Marx with an axe,
“Where I cut off one it will never grow again.”
O Karl would it were true
I’d put my saw to work for you
& the wicked social tree would fall right down.”
—Gary Snyder (b. 1930)