Search results
Results from the WOW.Com Content Network
Template talk: Hamiltonian platonic graphs.svg. ... Download as PDF; Printable version ... This template does not require a rating on Wikipedia's content assessment ...
Main page; Contents; Current events; Random article; About Wikipedia; Contact us; Donate; Pages for logged out editors learn more
The graph of a regular octahedron The skeleton of a regular octahedron can be represented as a graph according to Steinitz's theorem , provided the graph is planar —its edges of a graph are connected to every vertex without crossing other edges—and 3-connected graph —its edges remain connected whenever two of more three vertices of a ...
The polyhedral graph formed as the Schlegel diagram of a regular dodecahedron. In geometric graph theory, a branch of mathematics, a polyhedral graph is the undirected graph formed from the vertices and edges of a convex polyhedron. Alternatively, in purely graph-theoretic terms, the polyhedral graphs are the 3-vertex-connected, planar graphs.
It can also be found in nature and supramolecules, as well as the shape of the universe. The skeleton of a regular dodecahedron can be represented as the graph called the dodecahedral graph, a Platonic graph. Its property of the Hamiltonian, a path visits all of its vertices exactly once, can be found in a toy called icosian game.
[[Category:Mathematics templates]] to the <includeonly> section at the bottom of that page. Otherwise, add <noinclude>[[Category:Mathematics templates]]</noinclude> to the end of the template code, making sure it starts on the same line as the code's last character.
Hamiltonian platonic graphs: Image title: Orthographic projections and planar graphs of Hamiltonian cycles of the vertices of the five Platonic solids by CMG Lee. Only the octahedron has an Eulerian path, made by extending the Hamiltonian path with the dotted path. Width: 100%: Height: 100%
The truncated icosahedral graph. According to Steinitz's theorem, the skeleton of a truncated icosahedron, like that of any convex polyhedron, can be represented as a polyhedral graph, meaning a planar graph (one that can be drawn without crossing edges) and 3-vertex-connected graph (remaining connected whenever two of its vertices are removed ...