We find and prove the maximum rectilinear crossing number of the wheel graph. First, we illustrate a picture of the wheel graph with many crossings to prove a lower bound. We then prove that this bound is sharp. The treatment is divided into two cases for n even and n odd.
Feder, Elie. “The Maximum Rectilinear Crossing Number of the Wheel Graph”, Congressus Numerantium, 210, (2011), 21-32.