Search Results for ""

An n-polyhedral graph (sometimes called a c-net) is a 3-connected simple planar graph on n nodes. Every convex polyhedron can be represented in the plane or on the surface of ...

The regular dodecahedron, often simply called "the" dodecahedron, is the Platonic solid composed of 20 polyhedron vertices, 30 polyhedron edges, and 12 pentagonal faces, ...

A cube 13-compound can be constructed as the dual of the octahedron 13-compound. It will be implemented in a future version of the Wolfram Language as ...

A cube 9-compound can be constructed from the vertices of the first dodecahedron 2-compound. It will be implemented in a future version of the Wolfram Language as ...

There are a number of attractive polyhedron compounds consisting of ten octahedra. These compounds will be implemented in a future version of the Wolfram Language as ...

There are a number of attractive polyhedron compounds consisting of 12 octahedra. This compound will be implemented in a future version of the Wolfram Language as ...

There are a number of attractive polyhedron compounds consisting of 13 octahedra. This compound will be implemented in a future version of the Wolfram Language as ...

There are a number of attractive polyhedron compounds consisting of 25 octahedra. These compounds will be implemented in a future version of the Wolfram Language as ...

There are a number of attractive polyhedron compounds consisting of 30 octahedra. This compound will be implemented in a future version of the Wolfram Language as ...

There are a number of attractive polyhedron compounds consisting of 35 octahedra. This compound will be implemented in a future version of the Wolfram Language as ...