9

I have a graph and I need to find a minimum spanning tree to a given graph. What is to be done so that the output obtained is a binary tree?

Juho
  • 22,905
  • 7
  • 63
  • 117
Aditya.M
  • 103
  • 3

1 Answers1

19

There is nothing to be done: for instance, let $S_k$ denote the star graph with $k$ leaves. The graph $S_k$ has a unique spanning tree (which is $S_k$ itself), and it has a vertex with degree exactly $k$.

In fact, the general problem of finding a degree-constrained minimum spanning tree is NP-complete.

Juho
  • 22,905
  • 7
  • 63
  • 117