β
Correct Answer: (B)
the given graph is bipartite
Explanation: a graph is said to be colorable if two vertices connected by an edge are never of the same color. 2 colorable mean that this can be achieved with just 2 colors.
Explanation by: Mr. Dubey
a graph is said to be colorable if two vertices connected by an edge are never of the same color. 2 colorable mean that this can be achieved with just 2 colors.
Discussion
Question Analytics
491
Total Visits
3 y ago
Published
Mr. Dubey
Publisher
99%
Success Rate