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

Given G is a bipartite graph and the bipartitions of this graphs are U and V respectively. What is the relation between them? Correct Answer Sum of degrees of vertices in U = Sum of degrees of vertices in V

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.

Related Questions

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?
What is testing of a complete bipartite subgraph in a bipartite graph problem called?