0 votes 0 votes closed as a duplicate of: GATE CSE 2024 | Set 1 | Question: 24 how many spanning trees are possible for complete graph of 4 vertices Algorithms algorithms data-structures graph-theory + – Amoljadhav asked Mar 1 • closed Mar 3 by Hira Thakur Amoljadhav 161 views comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes formula to Calculate for spanning Trees for Kn is n^n-2 so here n=4 then the Spanning Trees 16 ꧁༒☬ĿọŗԀ 🆂🅷🅸🆅🅰☬༒꧂ answered Mar 3 ꧁༒☬ĿọŗԀ 🆂🅷🅸🆅🅰☬༒꧂ comment Share Follow See all 0 reply Please log in or register to add a comment.