What Is A Spanning Tree


  • 7 Jul, 2013

    spanning tree is a sub graph G' of graph G where V(G')=V(G) and E(G')<=E(G).A graph can have more than one spanning tree.The spanning tree which has minimum cost is called as minimum spanning tree.

    Comments Received:
    Please give your suggestions and feedback:

2009-2016 downloadmela.com. All rights reserved.