The Maximum Rectilinear Crossing Number of the Wheel Graph

Authors

Elie Feder, CUNY Kingsborough Community CollegeFollow

Document Type

Article

Publication Date

2011

Abstract

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.

Comments

This work was originally published in Congressus Numerantium.