Wheel Graph
Alternate name
Definition
As defined in this work, a wheel graph W_n of order n, sometimes simply called an n-wheel, is a graph that contains a cycle of order n - 1 and for which every graph vertex in the cycle is connected to one other graph vertex known as the hub. The edges of a wheel which include the hub are called spokes. The wheel W_n can be defined as the graph join K_1 + C_(n - 1), where K_1 is the singleton graph and C_n is the cycle graph, making it a (n, 1)-cone graph. Note that some authors adopt an alternate convention in which W_n denotes the wheel graph on n + 1 nodes.
Related terms
