Logo
Unionpedia
Communication
Get it on Google Play
New! Download Unionpedia on your Android™ device!
Install
Faster access than browser!
 

Hamiltonian path and Regular icosahedron

Shortcuts: Differences, Similarities, Jaccard Similarity Coefficient, References.

Difference between Hamiltonian path and Regular icosahedron

Hamiltonian path vs. Regular icosahedron

In the mathematical field of graph theory, a Hamiltonian path (or traceable path) is a path in an undirected or directed graph that visits each vertex exactly once. In geometry, a regular icosahedron is a convex polyhedron with 20 faces, 30 edges and 12 vertices.

Similarities between Hamiltonian path and Regular icosahedron

Hamiltonian path and Regular icosahedron have 6 things in common (in Unionpedia): Coxeter group, Distance (graph theory), Dodecahedron, Graph (discrete mathematics), Planar graph, Platonic solid.

Coxeter group

In mathematics, a Coxeter group, named after H. S. M. Coxeter, is an abstract group that admits a formal description in terms of reflections (or kaleidoscopic mirrors).

Coxeter group and Hamiltonian path · Coxeter group and Regular icosahedron · See more »

Distance (graph theory)

In the mathematical field of graph theory, the distance between two vertices in a graph is the number of edges in a shortest path (also called a graph geodesic) connecting them.

Distance (graph theory) and Hamiltonian path · Distance (graph theory) and Regular icosahedron · See more »

Dodecahedron

In geometry, a dodecahedron (Greek δωδεκάεδρον, from δώδεκα dōdeka "twelve" + ἕδρα hédra "base", "seat" or "face") is any polyhedron with twelve flat faces.

Dodecahedron and Hamiltonian path · Dodecahedron and Regular icosahedron · See more »

Graph (discrete mathematics)

In mathematics, and more specifically in graph theory, a graph is a structure amounting to a set of objects in which some pairs of the objects are in some sense "related".

Graph (discrete mathematics) and Hamiltonian path · Graph (discrete mathematics) and Regular icosahedron · See more »

Planar graph

In graph theory, a planar graph is a graph that can be embedded in the plane, i.e., it can be drawn on the plane in such a way that its edges intersect only at their endpoints.

Hamiltonian path and Planar graph · Planar graph and Regular icosahedron · See more »

Platonic solid

In three-dimensional space, a Platonic solid is a regular, convex polyhedron.

Hamiltonian path and Platonic solid · Platonic solid and Regular icosahedron · See more »

The list above answers the following questions

Hamiltonian path and Regular icosahedron Comparison

Hamiltonian path has 77 relations, while Regular icosahedron has 163. As they have in common 6, the Jaccard index is 2.50% = 6 / (77 + 163).

References

This article shows the relationship between Hamiltonian path and Regular icosahedron. To access each article from which the information was extracted, please visit:

Hey! We are on Facebook now! »