Graphs and Degrees · Challenge problem

The wheel $W_n$ (a hub joined to every vertex of an $n$-cycle) and the complete bipartite graph $K_{m,k}$ ($m,k\ge2$) have the same number of vertices AND the same number of edges. What is $n$?