1. Prove that for any fixed set of node locations, the minimum possible total length of a tree interconnecting all nodes is less than the minimum possible length of any ring interconnecting all nodes.
As it is maths subject GRE forum, I think that I can get help from u guys.
-Waiting for your help...
Thanx in advance,
Shruti