gives the wheel graph with n vertices .

Details and OptionsDetails 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.
Introduced in 2010