πŸ“Š Design and Analysis of Algorithms
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.


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

πŸ“Š Question Analytics

πŸ‘οΈ
748
Total Visits
πŸ“½οΈ
3 y ago
Published
πŸŽ–οΈ
Mr. Dubey
Publisher
πŸ“ˆ
97%
Success Rate