Q606
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
AnswerB.
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
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board