Search Results for ""

The 13 Archimedean dual graphs are the skeletons of the Archimedean dual solids, illustrated above. Since they are polyhedral graphs, they are also planar. However, none of ...

The cube-octahedron compound is a polyhedron compound composed of a cube and its dual polyhedron, the octahedron. It is implemented in the Wolfram Language as ...

An untraceable graph is a graph that does not possess a Hamiltonian path, i.e., one that is not traceable. All disconnected graphs are therefore untraceable. Untraceable ...

A deltahedron is a polyhedron whose faces are congruent equilateral triangles (Wells 1986, p. 73). Note that polyhedra whose faces could be triangulated so as to be composed ...

The great ditrigonal dodecicosidodecahedron is the uniform polyhedron with Maeder index 42 (Maeder 1997), Wenninger index 81 (Wenninger 1989), Coxeter index 54 (Coxeter et ...

The cuboctahedron, also called the heptaparallelohedron or dymaxion (the latter according to Buckminster Fuller; Rawles 1997), is the Archimedean solid with faces 8{3}+6{4}. ...

Baer's criterion, also known as Baer's test, states that a module M over a unit ring R is injective iff every module homomorphism from an ideal of R to M can be extended to a ...

The bead-sorting algorithm orders a list of a positive integers increasingly by representing numbers as a list of a 1s, where each 1 stands for a bead. The k initial integers ...

A number of attractive 2-compounds of the regular dodecahedron can be constructed. The first (left figures) has the symmetry of the cube and arises by combining two regular ...

A number of attractive 6-compounds of the regular dodecahedron can be constructed. The first (left figures) can be obtained by combining six dodecahedra, each rotated by 1/10 ...