- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- How many spanning trees does a complete ...

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

A. | nm |

B. | mn-1 * nn-1 |

C. | 1 |

D. | 0 |

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 |

View all MCQs in:
Design and Analysis of Algorithms

- Consider a complete graph G with 4 vertices. The graph G has spanning trees.
- What is testing of a complete bipartite subgraph in a bipartite graph problem called?
- Which term defines all the complete bipartite graph that are trees?
- A k-regular bipartite graph is the one in which degree of each vertices is k for all the vertices in the graph. Given that the bipartitions of this graph are U and V respectively. What is the relation between them?
- Is every complete bipartite graph a Moore Graph.
- Is it true that every complete bipartite graph is a modular graph.
- From the given graph, how many vertices can be matched using maximum matching in bipartite graph algorithm?
- What is the chromatic number of compliment of line graph of bipartite graph?
- What is the clique size of the line graph of bipartite graph?
- If all the weights of the graph are positive, then the minimum spanning tree of the graph is a minimum cost subgraph.

Login to Continue

It will take less than 2 minutes

Report MCQ