Return the wheel graph
The wheel graph consists of a hub node connected to a cycle of (n-1) nodes.
- n (int or iterable) – If an integer, node labels are 0 to n with center 0. If an iterable of nodes, the center is the first.
- create_using (NetworkX graph constructor, optional (default=nx.Graph)) – Graph type to create. If graph instance, then cleared before populated.
- Node labels are the integers 0 to n - 1.