Search Results for ""

A triangle center (sometimes simply called a center) is a point whose trilinear coordinates are defined in terms of the side lengths and angles of a triangle and for which a ...

The triangle graph is the cycle graph C_3, which is isomorphic to the complete graph K_3 as well as to the complete tripartite graph K_(3×1)=K_(1,1,1) and the triangular ...

There are two types of squares inscribing reference triangle DeltaABC in the sense that all vertices lie on the sidelines of ABC. The first type has two adjacent vertices of ...

The 14-faced Archimedean solid with faces 8{3}+6{8}. It is also the uniform polyhedron with Maeder index 9 (Maeder 1997), Wenninger index 8 (Wenninger 1989), Coxeter index 21 ...

The cubic Archimedean graph on 24 nodes and 36 edges that is the skeleton of the truncated cube. It is implemented in the Wolfram Language as ...

The cubic Archimedean graph on 60 nodes and 90 edges that is the skeleton of the truncated dodecahedron. It is implemented in the Wolfram Language as ...

The truncated dodecahedron is the 32-faced Archimedean solid with faces 20{3}+12{10}. It is also uniform polyhedron with Maeder index 26 (Maeder 1997), Wenninger index 10 ...

The truncated octahedral graph is the cubic Archimedean graph on 24 nodes and 36 edges that is the skeleton of the truncated octahedron. It is isomorphic to the Bruhat graph ...

Turmites, also called turning machines, are 2-dimensional Turing machines in which the "tape" consists of a grid of spaces that can be written and erased by an active ...

Tutte (1971/72) conjectured that there are no 3-connected nonhamiltonian bicubic graphs. However, a counterexample was found by J. D. Horton in 1976 (Gropp 1990), and several ...