1 votes 1 votes Graph Theory graph-theory + – Pawan Kumar 2 asked Dec 24, 2017 Pawan Kumar 2 347 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply joshi_nitish commented Dec 24, 2017 reply Follow Share you can use kirchoff rule(but it will be lengthy) directly you can do like this-> you need 3 edges for spanning tree, means you need to remove 2 edges. select 2 edges in $\binom{5}{2}$ ways, but also you need to see that 2 pair of edges(1-4, 1-3) and (2-3, 2-4) can not be selected as they will disconnect the graph, so total spanning trees possible are-> total ways to remove 2 extra edges= $\binom{5}{2}$-2 = 8 4 votes 4 votes Pawan Kumar 2 commented Dec 24, 2017 reply Follow Share Thank you very much Sir. 0 votes 0 votes Please log in or register to add a comment.