3 votes 3 votes For a complete graph with 10 vertices, The number of spanning trees is at least_____? Graph Theory spanning-tree graph-theory + – Parshu gate asked Nov 16, 2017 Parshu gate 2.4k views answer comment Share Follow See all 6 Comments See all 6 6 Comments reply Show 3 previous comments Sukannya commented Nov 17, 2017 reply Follow Share Minimum can be 1 because every graph has atleast 1 spanning tree 2 votes 2 votes iarnav commented Nov 26, 2017 reply Follow Share Minimum number of spannig tree(s) is found by applying Kirchhoff's theorem. Refer- https://en.wikipedia.org/wiki/Kirchhoff%27s_theorem 0 votes 0 votes A_i_$_h commented Nov 26, 2017 reply Follow Share @iarnav where is it mentioned that it gives minimum spanning tree ? i am not able to find....sorry might have overlooked 0 votes 0 votes Please log in or register to add a comment.
3 votes 3 votes Exactly 108. Lakshay Kakkar answered Nov 30, 2017 Lakshay Kakkar comment Share Follow See all 4 Comments See all 4 4 Comments reply Sona Barman commented Jan 20, 2018 reply Follow Share This is the answer of maximum possible.But as per the question at least? 0 votes 0 votes akash.dinkar12 commented Jan 20, 2018 reply Follow Share There is no concept of at least MST's 0 votes 0 votes smsubham commented Feb 28, 2018 reply Follow Share @sonu The question asks Spanning tree, not MST so it will be same as given in answer above. There is a difference between the number of Minimum spanning tree and the Minimum number of spanning tree. 1 votes 1 votes Ankur29 commented Aug 22, 2020 reply Follow Share i think answer will be.. 9 this is complete graph then every vertex connected to other n-1 vertex so minimum spanning tree 9 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes 511 # mst in complete graph<=$2^{n-1^{}}-1$ from classical data structures by Samanta debasis afroze answered Jul 17, 2022 afroze comment Share Follow See all 0 reply Please log in or register to add a comment.