0 0 votes Number of spanning trees in a complete bipartite graph with m=4 and n=4 vertices? Explain with proper explanation ... Algorithms + – Raghav Khajuria 1.3k views answer comment Share Follow Print See all 10 Comments 10 10 Comments reply Show 7 previous comments rajatmyname commented Sep 18, 2018 reply Follow flag I think the answer can be 12C3 0 0 replyShare Shaik Masthan commented Sep 18, 2018 reply Follow flag @Raghav Khajuria complete bi partied graph there would be no cycle who says there is no cycle in complete bi-pertite graph? check this {a1,a2,a3},{b1,b2} a1-b1-a2-b2-a1 0 0 replyShare Shaik Masthan commented Sep 18, 2018 reply Follow flag @srestha mam, thanks for the link. 0 0 replyShare Please log in or register to add a comment.
