Definition Kmn denotes a complete bipartite graph on m n ver
Definition: Km,n denotes a complete bipartite graph on (m, n) vertices.
a. Draw K4,2
b. How many edges are there in the graph Km,n ?
c. What is the total degree of the graph Km,n ?
Solution
a.
Graph of K4,2
http://www.wolframalpha.com/input/?i=K_%7B4,2%7D
b.
Each element in one partiaion has edge to each vertex in other partiaion
Hence, mn edges
c.
Total degree =2* number of edges =2mn
