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

  • (A) 1
  • (B) 4
  • (C) 3
  • (D) 5
💬 Discuss
✅ Correct 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.

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.

💬 Discussion

Related MCQs

Q. If the initial pulse of 1000 is fed to shift register, after how many clock pulses does the sequence repeat?

Q. The number failed attempts to access memory, stated in the form of a fraction is called as

Q. Capital recovery costs are incurred by purchasing assets to be used in production and service.

Q. What is the time duration of a bit if data is transmitted at 270.833 kbps in the channel?

Q. Given the command $ chmod o-w datafile

Q. Which of the following is used as middleware layer in the following figure?

Q. NAT stands for _____ .

Q. The system identifies the end of a file by the

Q. The maximum number of indexes on MyISAM table is

Q. Which professional groups are most appropriately involved in preparation and performance of the classic kind of cognitive walkthrough?

📊 Question Analytics

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