The research on this page is brought to you by Taylor & Francis Knowledge Centers. This collection is automatically generated from our most recent books and journals on this topic.
The problem, initially given by Hamilton, was the trip around the earth: consider twenty cities on the globe and suppose that these cities are the vertices of a regular dodecahedron. How can a traveller go once, and only once, through each city and come back to the departure point (the roads between the cities are the edges of the dodecahedron)? The elegant solution given by Hamilton made use of the structure of the regular dodecahedron (cf.Berge, 1973, p. 179). When the dodecahedron is replaced by any graph, then we get the problem of the Hamiltonian cycle.
Conjugate heat transfer analysis within in lattice-filled heat exchanger for additive manufacturing
The model of lattice pattern used in this study is called the Dodecahedron network [25]. The geometry of the dodecahedron is a polyhedron with twelve flat faces as shown in Figure 1. The best-known dodecahedron is the regular dodecahedron, which is a platonic solid.