A wheel graph is formed by connecting a single universal vertex, or hub, to every vertex of a cycle; equivalently, a wheel graph on n vertices can be defined as the 1-skeleton of an (n minus 1)-sided pyramid. Different authors use slightly different conventions for how many vertices the notation Wn refers to, either the wheel's total vertex count or the length of its underlying cycle.
Facts
Connections
In Branch
Source Wikipedia: Wheel graph
Is Kind Of Object
Entity-backed identity for the object-kind enum value this mathematical object already carries, resolved to a mathematics concept by an explicit value-to-entity map (phase 3 bucket conversion, docs\design_entity_backed_browse_buckets_20260928.md). The object-kind fact itself stays on the object unchanged.
Sources
1. Wikipedia: Wheel graph
Lead section
a wheel graph is a graph formed by connecting a single universal vertex to all vertices of a cycle
In Branch: Graph Theory, Lead sentence
In graph theory, a wheel graph is a graph formed by connecting a single universal vertex to all vertices of a cycle.
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.