wheel graph

The wheel graph of $n$ vertices $W_{n}$ is a graph that contains a cycle of length $n-1$ plus a vertex $v$ (sometimes called the hub) not in the cycle such that $v$ is connected to every other vertex. The edges connecting $v$ to the rest of the graph are sometimes called spokes.

$W_{4}$ :

$\xymatrix{&A\ar@{-}[d]\ar@{-}[ddl]\ar@{-}[ddr]&\\ &D&\\ C\ar@{-}[ur]\ar@{-}[rr]&&B\ar@{-}[ul]}$

$W_{6}$ :

$\xymatrix{&&A\ar@{-}[d]\ar@{-}[drr]&&\\ E\ar@{-}[rr]\ar@{-}[urr]&&F&&B\ar@{-}[ll]\ar@{-}[dl]\\ &D\ar@{-}[ur]\ar@{-}[ul]&&C\ar@{-}[ul]\ar@{-}[ll]&\\ }$

Title	wheel graph
Canonical name	WheelGraph
Date of creation	2013-03-22 12:17:27
Last modified on	2013-03-22 12:17:27
Owner	vampyr (22)
Last modified by	vampyr (22)
Numerical id	5
Author	vampyr (22)
Entry type	Definition
Classification	msc 05C99
Synonym	hub
Synonym	spoke