Search Results for ""

In logic, the term "homomorphism" is used in a manner similar to but a bit different from its usage in abstract algebra. The usage in logic is a special case of a "morphism" ...

The ten-of-diamonds decahedron is a stereohedron and space-filling polyhedron on 8 vertices, 16 edges, and 10 faces (8 of which are non-equilateral triangles and two of which ...

"The" tetrahedral graph is the Platonic graph that is the unique polyhedral graph on four nodes which is also the complete graph K_4 and therefore also the wheel graph W_4. ...

There are a number of attractive compounds of two regular tetrahedra. The most symmetrical is the arrangement whose outer hull is the stella octangula (left figure), while ...

Given a regular tetrahedron of unit volume, consider the lengths of line segments connecting pairs of points picked at random inside the tetrahedron. The distribution of ...

In general, a tetrakis hexahedron is a non-regular icositetrahedron that can be constructed as a positive augmentation of a cube. Such a solid is also known as a ...

The Dyck graph is unique cubic symmetric graph on 32 nodes, illustrated above in a number of embeddings. It is denoted F_(032)A in the Foster census of cubic symmetric graphs ...

A line graph L(G) (also called an adjoint, conjugate, covering, derivative, derived, edge, edge-to-vertex dual, interchange, representative, or theta-obrazom graph) of a ...

The Möbius-Kantor graph is the unique cubic symmetric graph on 16 nodes, illustrated above in several embeddings. Its unique canonical LCF notation is [5,-5]^8. The ...

The Pappus graph is a cubic symmetric distance-regular graph on 18 vertices, illustrated above in three embeddings. It is Hamiltonian and can be represented in LCF notation ...