M

Mr. Dubey • 52.30K Points
Coach 

Q. Given G is a bipartite graph and the bipartitions of this graphs are U and V respectively. What is the relation between them?

(A) number of vertices in u = number of vertices in v
(B) sum of degrees of vertices in u = sum of degrees of vertices in v
(C) number of vertices in u > number of vertices in v
(D) nothing can be said
Correct : Option (B)

Explanation: 
 we can prove this by induction. by adding one edge, the degree of vertices in u is equal to 1 as well as in v. let us assume that this is true for n-1 edges and add one more edge. since the given edge adds exactly once to both u and v we can tell that this statement is true for all n vertices.

Share

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. Recursive solution of subset sum problem is faster than dynamic problem solution in terms of time complexity.

Q. The following flowchart is intended to evaluate in any cloud.

Q. What is the definition of Boolean functions?

Q. Which of the following to keep track of the individual units of data (called packets) that a message is divided into for efficient routing through the

Q. Easily reloctable language is

Q. Which of the following can be identified as cloud

Q. A situation where several processes access and manipulate the same data concurrently and the outcome of the execution depends on the particular order

Q. For which of the following computers can’t be used?

Q. Query tool is meant for_________.

Q. A unique piece of information that is used in encryption.