# A bipartite graph G = (S, T; E) is called complete if every vertex in S is joined to every vertex in T by an edge, and is denoted by K n1,n2 , where n 1 and n 2 are the numbers of vertices in S and T, respectively. How many edges does this graph have?

Chapter 23, PROBLEM SET 23.8 #16

A bipartite graph G = (S, T; E) is called complete if every vertex in S is joined to every vertex in T by an edge, and is denoted by K_{n1,n2}_{,} where n_{1} and n_{2} are the numbers of vertices in S and T, respectively. How many edges does this graph have?

## This problem has been solved!

Do you need an answer to a question different from the above? Ask your question!

**Related Book For**

PROBLEM SET 23.2:

PROBLEM SET 23.4:

PROBLEM SET 23.5:

PROBLEM SET 23.6:

PROBLEM SET 23.7:

PROBLEM SET 23.8: