Arrange the following graphs in increasing order of number of edges (for n > 3): A. Kₙ (complete graph), B. Cₙ (cycle graph), C. Wₙ (wheel graph), D. Kₙ,ₙ (complete bipartite graph), E. Qₙ (n-cube graph).

1. AA, B, C, D, E
2. BB, C, A, D, E
3. CA, B, C, E, D
4. DE, D, C, A, B

Pick an option to check yourself, or open the answer below.

Show answer & explanation

Correct answer: B. B, C, A, D, E

Explanation

Edges: Cₙ = n, Wₙ = 2n, Kₙ = n(n−1)/2, Kₙ,ₙ = n², Qₙ = n·2ⁿ⁻¹. For the larger n the question intends, these increase in the order C, W, K, Kₙ,ₙ, Q.