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? (Solved)

1. number of vertices in u=number of vertices in v

2. number of vertices in u not equal to number of vertices in v

3. number of vertices in u always greater than the number of vertices in v

4. nothing can be said

  • a. number of vertices in u=number of vertices in v
Subscribe Now

Get All Updates & News