M

Mr. Dubey • 53.59K Points
Coach 

Q. When is a graph said to be bipartite?

(A) if it can be divided into two independent sets a and b such that each edge connects a vertex from to a to b
(B) if the graph is connected and it has odd number of vertices
(C) if the graph is disconnected
(D) if the graph has at least n/2 vertices whose degree is greater than n/2
Share
Explanation by: Mr. Dubey 
 a graph is said to be bipartite if it can be divided into two independent sets a and b such that each edge connects a vertex from a to b.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Loading Comments....

Related MCQs

Q. Which of the IP headers decides when the packet should be discarded?

Q. Which of the following represents an SI unit of luminous intensity?

Q. CMOS logic dissipates power than NMOS logic circuits.

Q. R is a relation from {11, 12, 13} to {8, 10, 12} defined by y = x – 3. The relation R – 1 is

Q. What is the Cardinality of the Power set of the set {0, 1, 2}.

Q. Which among the following command is used to copy a directory from one node to another in HDFS?

Q. A data structure that follows the FIFO principle.

Q. When the process issues an I/O request

Q. The following command is used for inserting records

Q. The process of documenting the seizure of digital evidence and, in particular, when that evidence changes hands, is known as:

Question analytics