M

Mr. Dubey • 89.34K Points
Coach

Q. A k-regular bipartite graph is the one in which degree of each vertices is k for all the vertices in the graph. Given that the bipartitions of this graph are U and V respectively. What is the relation between them?

  • (A) number of vertices in u=number of vertices in v
  • (B) number of vertices in u not equal to number of vertices in v
  • (C) number of vertices in u always greater than the number of vertices in v
  • (D) nothing can be said
Share
Explanation by: Mr. Dubey
we know that in a bipartite graph sum of degrees of vertices in u=sum of degrees of vertices in v. given that the graph is a k-regular bipartite graph, we have k* (number of vertices in u)=k*(number of vertices in v).

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Loading Comments....

Related MCQs

Q. Reverse engineering is the process of deriving the system design and specification from its

Q. The octal equivalent of (247) 10 is

Q. In HDFS the files cannot be

Q. Software does not-----------

Q. What can be the maximum sum of digits for a 4 digit number?

Q. NVIDIA CUDA Warp is made up of how many threads?

Q. SVMs directly give us the posterior probabilities P(y = 1jx) and P(y = ?1jx)

Q. If there are N routers from source to destination, total end to end delay in sending packet P(L->number of bits in the packet R-> transmission r

Q. A model of language consists of the categories which does not include?

Q. In the normal form, a composite attribute is converted to individual attributes.

Question analytics