| Wheel graph | |
| Girth: | 3 |
| Diameter: | 2 if 1 if |
| Chromatic Number: | 4 if is even 3 if is odd |
| Spectrum: | \{2\cos(2k\pi/(n-1))1; k=1,\ldots,n-2\} \cup\{1\pm\sqrt{n}\} |
In the mathematical discipline of graph theory, a wheel graph is a graph formed by connecting a single universal vertex to all vertices of a cycle. A wheel graph with vertices can also be defined as the 1-skeleton of an pyramid. Some authors write to denote a wheel graph with vertices ; other authors[1] instead use to denote a wheel graph with vertices, which is formed by connecting a single vertex to all vertices of a cycle of length . The rest of this article uses the former notation.
Given a vertex set of, the edge set of the wheel graph can be represented in set-builder notation by {{1, 2}, {1, 3}, …, {1, v}, {2, 3}, {3, 4}, …, {v − 1, v}, {v, 2}}.[2]
Wheel graphs are planar graphs, and have a unique planar embedding. More specifically, every wheel graph is a Halin graph. They are self-dual: the planar dual of any wheel graph is an isomorphic graph. Every maximal planar graph, other than K4 = W4, contains as a subgraph either W5 or W6.
There is always a Hamiltonian cycle in the wheel graph and there are
n2-3n+3
For odd values of n, Wn is a perfect graph with chromatic number 3: the vertices of the cycle can be given two colors, and the center vertex given a third color. For even n, Wn has chromatic number 4, and (when n ≥ 6) is not perfect. W7 is the only wheel graph that is a unit distance graph in the Euclidean plane.[3]
The chromatic polynomial of the wheel graph Wn is :
| P | |
| Wn |
(x)=x((x-2)(n-(-1)n(x-2)).
In matroid theory, two particularly important special classes of matroids are the wheel matroids and the whirl matroids, both derived from wheel graphs. The k-wheel matroid is the graphic matroid of a wheel Wk+1, while the k-whirl matroid is derived from the k-wheel by considering the outer cycle of the wheel, as well as all of its spanning trees, to be independent.
The wheel W6 supplied a counterexample to a conjecture of Paul Erdős on Ramsey theory: he had conjectured that the complete graph has the smallest Ramsey number among all graphs with the same chromatic number, but Faudree and McKay (1993) showed W6 has Ramsey number 17 while the complete graph with the same chromatic number, K4, has Ramsey number 18.[4] That is, for every 17-vertex graph G, either G or its complement contains W6 as a subgraph, while neither the 17-vertex Paley graph nor its complement contains a copy of K4.