Q. It is possible to have a negative chromatic number of bipartite graph.

  • (A) true
  • (B) false
  • (C) ---
  • (D) ---
💬 Discuss
✅ Correct Answer: (B) false
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. but the chromatic number cannot be negative.

Published by Mr. Dubey ⭐ 104.82K Points at 16-Sep-2023 03:44 pm in Design and Analysis of Algorithms

Explanation by: Mr. Dubey
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. but the chromatic number cannot be negative.

💬 Discussion

Related MCQs

Q. A variable on its own or in its complemented form is known as a

Q. Which of the following data structure is not linear data structure?

Q. In order to assess how much information is brought by each component, and the correlation among them, a useful tool is the .

Q. Is a customer involved test development and validation in XP ?

Q. The following symbol denotes:

Q. In 2NF

Q. A priori algorithm is otherwise called as_________

Q. Each neuron is made up of a number of nerve fibers called________.

Q. LCM is also called as

Q. Let (A, ≤) be a poset. A subset of A is known as ------if every pair of elements in the subset are related.

📊 Question Analytics

👁️
809
Total Visits
📽️
3 y ago
Published
🎖️
Mr. Dubey
Publisher
📈
95%
Success Rate