gives the wheel graph with n vertices .
Details and Options
- A wheel graph of order n is a graph formed by connecting a single vertex to all the vertices of a cycle of order n-1.
- WheelGraph[…,DirectedEdges->True] gives a directed wheel graph.
- WheelGraph takes the same options as Graph.
Basic Examples (2)
The first few wheel graphs :
Directed wheel graphs:
Properties & Relations (4)