###### Question 9491 – GATE 2004

October 29, 2023###### NTA UGC NET JUNE-2023 Paper-2

October 29, 2023# Question 3707 – UGC NET CS 2015 Dec- paper-2

Consider the graph given below: The two distinct sets of vertices, which make the graph bipartite are:

Correct Answer: C

Question 4 Explanation:

A bipartite graph (or bigraph) is a graph whose vertices can be divided into two disjoint and independent sets U and V such that every edge connects a vertex in U to one in V. Vertex sets U and V are usually called the parts of the graph. Equivalently, a bipartite graph is a graph that does not contain any odd-length cycles.

→ The two sets U and V may be thought of as a coloring of the graph with two colors.

Option A: FALSE because V

Option-B FALSE because V

Option-C TRUE because it follows properties of bipartied and no two colours are adjacent.

Option-D FALSE because because V

→ The two sets U and V may be thought of as a coloring of the graph with two colors.

Option A: FALSE because V

_{5} , V_{ 7} and V_{ 3} are adjacent. So, it not not bipartite graph.Option-B FALSE because V

_{5} , V_{ 6} and V_{ 2} are adjacent. So, it not not bipartite graph.Option-C TRUE because it follows properties of bipartied and no two colours are adjacent.

Option-D FALSE because because V

_{4} , V_{ 6} and V_{ 8} are adjacent. So, it not not bipartite graph.(v

_{1} , v_{ 4} , v_{ 6} ); (v_{ 2} , v_{ }3 , v_{ 5} , v_{ 7} , v_{ 8} )(v

_{1} , v_{ 7} , v_{ 8} ); (v_{ 2} , v_{ 3} , v_{ 5} , v_{ 6} )(v

_{1} , v_{ 4} , v_{ 6} , v_{ 7} ); (v_{ 2} , v_{ 3} , v_{ 5} , v_{ 8} )(v

_{1} , v_{ 4} , v_{ 6} , v_{ 7} , v_{ 8} ); (v_{ 2} , v_{ 3} , v_{ 5} )
Subscribe

Login

0 Comments