0 votes 0 votes Algorithms spanning-tree numerical-answers ace-test-series + – Shankar Kakde asked Jan 24, 2019 • retagged Jul 8, 2022 by Lakshman Bhaiya Shankar Kakde 977 views answer comment Share Follow See 1 comment See all 1 1 comment reply OneZero commented Jan 24, 2019 reply Follow Share 60? 0 votes 0 votes Please log in or register to add a comment.
5 votes 5 votes For a complete graph $K_n;$ Number of spanning trees$= n^{n-2}$ here $n=5$, So Number of spanning trees $= 5^{5-2} = 5^3 =125$ twin_123 answered Jan 24, 2019 • edited Jul 2, 2019 by akash.dinkar12 twin_123 comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes Answer$- 125$ Since it is a complete graph of $5$ vertices. Hence no of spanning trees are $n^{n-2}$ $5^{5-2} =5^3=125$ Priyanka Sharma answered Jan 28, 2019 • edited Jul 2, 2019 by akash.dinkar12 Priyanka Sharma comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes $125$ as it is a complete graph hence $n^{n-2}$ will be the answer Sandhya Singh answered Jul 2, 2019 • edited Jul 2, 2019 by akash.dinkar12 Sandhya Singh comment Share Follow See all 0 reply Please log in or register to add a comment.