Bipartite Graphs on Data Structure and Algorithms related Questions and Answers


Question :   How many spanning trees does a complete bipartite graph contain?
1. nm
2. mn-1 * nn-1
3. 1
4. 0
Answer :   2 - mn-1 * nn-1  

* Be the First to Post a Comment.

Submit comment :


Captcha Image
Reload

Ask Question

Captcha Image
Reload

Note : Name and Email never shown.





Subscribe


Become a part of EducationForever. Subscribe to our FREE Newsletter