5 votes 5 votes monali asked Nov 2, 2015 monali 5.2k views answer comment Share Follow See all 6 Comments See all 6 6 Comments reply Show 3 previous comments Arjun commented Nov 3, 2015 reply Follow Share if edge weights are not distinct minimum spanning tree can be more than one. 1 votes 1 votes LeenSharma commented Nov 3, 2015 reply Follow Share yes it can be more than one when all nodes have same weight then no of spanning tree will be equal to number of edges. but sir how to calculate minimum number of spanning tree .There is only one thing is given that is number of nodes? 0 votes 0 votes Arjun commented Nov 3, 2015 reply Follow Share Actually the question is wrong. spanning tree - is defined for Graph connected tree - a tree is be definition connected. And minimum no. of spanning tree in a connected graph should be 1- consider a line graph. 4 votes 4 votes Please log in or register to add a comment.
