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 n vertices can also be defined as the 1-skeleton of an (n – 1)-gonal pyramid. Some authors[1] write Wn to denote a wheel graph with n vertices (n ≥ 4); other authors[2] instead use Wn to denote a wheel graph with n + 1 vertices (n ≥ 3), which is formed by connecting a single vertex to all vertices of a cycle of length n. The rest of this article uses the former notation.
^Weisstein, Eric W. "Wheel Graph". MathWorld.
^Rosen, Kenneth H. (2011). Discrete Mathematics and Its Applications (7th ed.). McGraw-Hill. p. 655. ISBN 978-0073383095.
discipline of graph theory, a wheelgraph is a graph formed by connecting a single universal vertex to all vertices of a cycle. A wheelgraph with n vertices...
Appendix:Glossary of graph theory in Wiktionary, the free dictionary. This is a glossary of graph theory. Graph theory is the study of graphs, systems of nodes...
In complex analysis, domain coloring or a color wheelgraph is a technique for visualizing complex functions by assigning a color to each point of the...
algorithm. DSatur is a heuristic graph colouring algorithm, yet produces exact results for bipartite, cycle, and wheelgraphs. DSatur has also been referred...
eighteenth century. The triangular bipyramid has a graph with its construction involving the wheelgraph. Like other bipyramids, the triangular bipyramid...
the base. It can be represented as the wheelgraph W 4 {\displaystyle W_{4}} ; more generally, a wheelgraph W n {\displaystyle W_{n}} is the representation...
graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called "colors" to elements of a graph subject...
{\displaystyle W_{n}} is a wheelgraph on n vertices. Unsolved problem in mathematics: Is the pebbling number of a Cartesian product of graphs at most the product...
cycle, and wheelgraphs. In general, however, the algorithm is approximate and may well return solutions that use more colors than the graph’s chromatic...
higher-level languages. For instance, a Car class can compose a Wheel one. In the object graph a Car instance will have up to four links to its wheels, which...
In graph theory, the strong perfect graph theorem is a forbidden graph characterization of the perfect graphs as being exactly the graphs that have neither...
Archimedean graphs. Platonic graphWheelgraph An Atlas of Graphs, p. 267-270 An Atlas of Graphs, p. 261 Read, R. C. and Wilson, R. J. An Atlas of Graphs, Oxford...
A bond graph is a graphical representation of a physical dynamic system. It allows the conversion of the system into a state-space representation. It...
mathematical discipline of graph theory, the dual graph of a planar graph G is a graph that has a vertex for each face of G. The dual graph has an edge for each...
graph formed in a similar way from polyhedra with regular-polygon bases include the antiprism graphs (graphs of antiprisms) and wheelgraphs (graphs of...
Halin graph construction to a star produces a wheelgraph, the graph of the (edges of) a pyramid. The graph of a triangular prism is also a Halin graph: it...
two-dimensional graphs, complex functions have four-dimensional graphs and may usefully be illustrated by color-coding a three-dimensional graph to suggest...
wheelgraphs, similarly, may be formed by adding a universal vertex to a cycle graph. In geometry, the three-dimensional pyramids have wheelgraphs as...
Global Information
