Q. How many spanning trees does a complete bipartite graph contain?
✅ Correct Answer: (B)
mn-1 * nn-1
Explanation: spanning tree of a given graph is defined as the subgraph or the tree with all the given vertices but having minimum number of edges. so, there are a total of mn-1