Thread: Complete Bipartite Graphs

Let be a bipartite graph with vertex partition .

(a)
Prove That



(b)
A graph is k-regular if every vertex has degree k. Prove
that if G is k-regular with k > 0, then (remember that,in this question, G is bipartite with vertex partition .)

Recall that if then .
So part a follows from that.

Part b is from the definition of regularity.