7 votes 7 votes The number of spanning trees for a complete graph with seven vertices is $2^5$ $7^5$ $3^5$ $2^{2 \times 5}$ Algorithms isro2015 algorithms spanning-tree + – shivanisrivarshini asked Jun 5, 2016 edited Dec 4, 2022 by Lakshman Bhaiya shivanisrivarshini 6.8k views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply ManojK commented Jun 7, 2016 reply Follow Share https://gateoverflow.in/48555/isro-2015?show=48557#a48557 0 votes 0 votes Aishwarya Gujrathi commented Apr 14, 2018 reply Follow Share Why did we assume that the complete graph with seven vertices is labeled? Am I missing anything? 1 votes 1 votes Please log in or register to add a comment.
Best answer 19 votes 19 votes No of spanning tree possible in complete graph with n node=nn-2 So No of spanning tree possible in complete graph with 7 node=75 spanning tree possible in complete graph ManojK answered Jun 5, 2016 selected Jun 9, 2016 by shivanisrivarshini ManojK comment Share Follow See 1 comment See all 1 1 comment reply Tauhin Gangwar commented Jun 5, 2016 reply Follow Share correct 0 votes 0 votes Please log in or register to add a comment.
2 votes 2 votes Number of spanning tree in complete graph have k vertex==K^K-2 Ex:: K=7 No. of spanning tree possible is=7^7-2=7^5 Option B will be right option Paras Nath answered Oct 16, 2016 Paras Nath comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes Number of Spanning trees in Complete Graph of N vertices = N^(N-2) According to Question: N=7 So number of spanning trees will be = 7^(7-2) = 7 ^ 5 akash.dinkar12 answered Apr 14, 2017 akash.dinkar12 comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes number of spanning trees of a complete graph with n vertices = $n^{n-2}$ here n = 7 ans = $7^{5}$ dd answered Jun 6, 2016 dd comment Share Follow See all 0 reply Please log in or register to add a comment.