McqMate

Q. |
## How many colours are used in a bipartite graph? |

A. | 1 |

B. | 2 |

C. | 3 |

D. | 4 |

Answer» B. 2 | |

Explanation: a bipartite graph is said to be two-colourable so that every edge has its vertices coloured in different colours. |

3.5k

0

Do you find this helpful?

12

View all MCQs in

Design and Analysis of AlgorithmsNo comments yet

- 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?
- What is testing of a complete bipartite subgraph in a bipartite graph problem called?
- 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?
- Is every complete bipartite graph a Moore Graph.
- Is it true that every complete bipartite graph is a modular graph.
- How many spanning trees does a complete bipartite graph contain?
- Given G is a bipartite graph and the bipartitions of this graphs are U and V respectively. What is the relation between them?
- 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?