A graph of order n is a wheel if it contains a cycle of order n-1 and every node in the cycle is connected to a single other node or hub. The hub has degree n-1 and all other nodes have degree 3.

Thus W(4) = K(4), and some people define W(3) = K(3).

--back to combinatorics--