McqMate

Q. |
## What type of graph has chromatic number less than or equal to 2? |

A. | histogram |

B. | bipartite |

C. | cartesian |

D. | tree |

Answer» B. bipartite | |

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 chromatic number. |

1.3k

0

Do you find this helpful?

1

View all MCQs in

Design and Analysis of AlgorithmsNo comments yet

- What is the chromatic number of compliment of line graph of bipartite graph?
- Which one of the following is the chromatic number 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?
- 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?
- Consider a complete graph G with 4 vertices. The graph G has spanning trees.
- 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?
- 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.
- Consider the graph shown below. Which of the following are the edges in the MST of the given graph?