Which of the following graphs is bipartite?A. 𝐾3K 3​ B. 𝐶4C 4​ C. 𝐶3C 3​ D. 𝐾5K 5​

A bipartite graph is a graph whose vertices can be divided into two disjoint sets such that no two graph vertices within the same set are adjacent.

A. 𝐾3 (K3) - This is a complete graph with 3 vertices. In a complete graph, every pair of vertices is connected by an edge. Therefore, it is not possible to divide the vertices into two disjoint sets where no two vertices in the same set are adjacent. So, K3 is not a bipartite graph.

B. 𝐶4 (C4) - This is a cycle graph with 4 vertices. A cycle graph is bipartite if the number of vertices in the cycle is even. Since C4 has 4 vertices, it is a bipartite graph.

C. 𝐶3 (C3) - This is a cycle graph with 3 vertices. A cycle graph is bipartite if the number of vertices in the cycle is even. Since C3 has 3 vertices, it is not a bipartite graph.

D. 𝐾5 (K5) - This is a complete graph with 5 vertices. In a complete graph, every pair of vertices is connected by an edge. Therefore, it is not possible to divide the vertices into two disjoint sets where no two vertices in the same set are adjacent. So, K5 is not a bipartite graph.

So, among the given options, only 𝐶4 (C4) is a bipartite graph.