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.
0 votes 0 votes The number of spanning trees in the complete graph Kn is nn-2 Devshree Dubey answered Jun 11, 2016 Devshree Dubey comment Share Follow See all 0 reply Please log in or register to add a comment.