Wheel graph

Article summary

{{infobox graph | name = Wheel graph | image = Wheel graphs.svg | image_size = 220px | image_caption = Several examples of wheel graphs | girth = 3 | diameter = 2 if 1 if | vertices = | edges = | chromatic_number = 3 if is odd 4 if is even | chromatic_index = | spectrum = \{2\cos(2k\pi / (n - 1))^1; k = 1, \ldots, n - 2\} \cup\{1 \pm \sqrt{n}\} | properties = Hamiltonian Self-dual Planar | notation = }} In 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 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 former notation is used in the rest of this article and in the table on the right.

Key claims

No claims recorded.

Discussion questions

1. Summarise the article in your own words. Which single claim would you verify first, and why?
2. Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
3. If two sources disagreed about one of these facts, what would you need in order to trust one over the other?

Bibliography

No sources recorded.