A complete bipartite graph is a one in which each vertex in set X has an edge with set Y. Let n be the total number of vertices. For maximum number of edges, the total number of vertices hat should be present on set X is?

Mr. Dubey • 52.26K Points
Coach

Q. A complete bipartite graph is a one in which each vertex in set X has an edge with set Y. Let n be the total number of vertices. For maximum number of edges, the total number of vertices hat should be present on set X is?

(A) n

(B) n/2

(D) data insufficient

Correct : Option (B)

Explanation:

 we can prove this by calculus. let x be the total number of vertices on set x. therefore set y will have n-x. we have to maximize x*(n-x). this is true when x=n/2.

Discusssion

Q. To overcome multiple signals being generated upon a single press of the button, we make use of

Q. What is the Optimal page – replacement algorithm?

Q. The potential problems are identified and their probabilities and impacts are given weights in which technique

Q. The following is (are) the machine down time.

Q. You want to view a listing of previously enetered commands. What command would you use ?

Q. Which gate is best used as a basic comparator?

Q. ( 734)8 =( )16

Q. What is the first stage in software development?

Q. Which protocol interacts asynchronously over UDP?

Q. A complete bipartite graph is a one in which each vertex in set X has an edge with set Y. Let n be the total number of vertices. For maximum number of edges, the total number of vertices hat should be present on set X is?

Discusssion

Related MCQs