2 2 votes How many spanning trees does the following graph have ? Algorithms goclasses algorithms goclasses-cs-dpp goclasses-cs-dpp-day-94 goclasses-algo-practice-questions numerical-answers goclasses-algorithms-practice-questions + – GO Classes 763 views answer comment Share Follow Print See all 3 Comments 3 3 Comments reply yashk07 commented Sep 30, 2025 reply Follow flag First case when you dont consider 4 as edge of spanning tree then then no of spanning trees are : 3C1*4C1=12 when you consider 4 as edge then we should make sure we are not making cycle and we can express it with 4C1*(3C1-1) + 3C1*(4C1-1)=17 add both of them its 29 is the answer 1 1 replyShare Prashant-G commented May 15 reply Follow flag @GO Classes please add the answer as well we are confused about ki question is asking min spanning tree or just Spanning tree sir 0 0 replyShare Prashant-G commented May 24 reply Follow flag Done ✅ 0 0 replyShare Please log in or register to add a comment.
1 1 vote If the Question missed the word minimum then only Prashant-G answered May 15 Prashant-G comment Share Follow 0 reply Please log in or register to add a comment.
0 0 votes 12 Raj_Chihar answered Sep 26, 2025 Raj_Chihar comment Share Follow See all 2 Comments 2 2 Comments reply m_a_h_a_d_e_v commented Sep 27, 2025 reply Follow flag can you explain , how you obtained your answer? 0 0 replyShare Raj_Chihar commented Sep 27, 2025 reply Follow flag Actually i didn't read the question properly i caculate the number of minimum spanning trees. 4C3*3C2 0 0 replyShare Please log in or register to add a comment.
0 0 votes Answer 12 JAY_THAKAR answered Jan 10 JAY_THAKAR comment Share Follow 0 reply Please log in or register to add a comment.
