Recall that Km,n denotes a complete bipartite graph on (m, n) vertices. a. Draw K4,2 b

Chapter 10, Problem 36

(choose chapter or problem)

Recall that \(K_{m, n}\) denotes a complete bipartite graph on (m, n) vertices.

a. Draw \(K_{4,2}\)

b. Draw \(K_{1,3}\)

c. Draw \(K_{3,4}\)

d. How many vertices of \(K_{m, n}\) have degree m? degree n?

e. What is the total degree of \(K_{m, n}\)?

f. Find a formula in terms of m and n for the number of edges of \(K_{m, n}\). Explain.

Text Transcription:

K_m, n

K_4,2

K_1,3

K_3,4