Cormen

Question

Let $T$ be a minimum weight spanning tree of graph $G = (V, E)$, and let $V’$ be a subset of $V$ . Let $T'$ be a sub-graph of $T$ induced by $V'$ and let $G’$ be a sub-graph of $G$ induced by $V'$. Prove that If $T'$ is connected , then $T'$ is a minimum weight spanning tree of graph $G′$

Comments

what is the problem you are facing while proving it?

---

i am not able to draw any formal approach to prove it except some general examples. If you could prove it plz let me know

---

ok, i will add formal proof for it.