A

Admin • 828.03K Points
Coach

Q. How many spanning trees does a complete bipartite graph contain?

  • (A) nm
  • (B) mn-1 * nn-1
  • (C) 1
  • (D) 0
Explanation by: Admin
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

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.