McqMate

Q. |
## Which one of the following is the chromatic number of bipartite graph? |

A. | 1 |

B. | 4 |

C. | 3 |

D. | 5 |

Answer» A. 1 | |

Explanation: a graph is known as bipartite graph if and only if it has the total chromatic number less than or equal to 2. the smallest number of graphs needed to color the graph is the chromatic number. |

4.4k

0

Do you find this helpful?

23

View all MCQs in

Design and Analysis of AlgorithmsNo comments yet

- What is the chromatic number of compliment of line graph of bipartite graph?
- It is possible to have a negative chromatic number of bipartite graph.
- 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?
- 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?
- 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.
- From the given graph, how many vertices can be matched using maximum matching in bipartite graph algorithm?
- What type of graph has chromatic number less than or equal to 2?