McqMate

Q. |
## Which type of graph has all the vertex of the first set connected to all the vertex of the second set? |

A. | bipartite |

B. | complete bipartite |

C. | cartesian |

D. | pie |

Answer» B. complete bipartite | |

Explanation: the graph is known as bipartite if the graph does not contain any odd length cycle in it. the complete bipartite graph has all the vertex of first set connected to all the vertex of second set. |

2.7k

0

Do you find this helpful?

18

View all MCQs in

Design and Analysis of AlgorithmsNo comments yet

- A complete bipartite graph is a one in which each vertex in set X has an edge with set Y. Let n be the total number of vertices. For maximum number of edges, the total number of vertices hat should be present on set X is?
- In a bipartite graph G=(V,U,E), the matching of a free vertex in V to a free vertex in U is called?
- 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?
- Which graph has a size of minimum vertex cover equal to maximum matching?
- How many edges does a n vertex triangle free graph contains?
- The problem of finding a path in a graph that visits every vertex exactly once is called?
- Consider a undirected graph G with vertices { A, B, C, D, E}. In graph G, every edge has distinct weight. Edge CD is edge with minimum weight and edge AB is edge with maximum weight. Then, which of the following is false?
- Consider a complete graph G with 4 vertices. The graph G has spanning trees.
- Every Perfect graph has forbidden graph characterization.
- If all the weights of the graph are positive, then the minimum spanning tree of the graph is a minimum cost subgraph.