enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Regular dodecahedron - Wikipedia

    en.wikipedia.org/wiki/Regular_dodecahedron

    The regular dodecahedron is a polyhedron with twelve pentagonal faces, thirty edges, and twenty vertices. [1] It is one of the Platonic solids, a set of polyhedrons in which the faces are regular polygons that are congruent and the same number of faces meet at a vertex. [2]

  3. Schläfli symbol - Wikipedia

    en.wikipedia.org/wiki/Schläfli_symbol

    Regular star polygons are not convex, and their Schläfli symbols {p / q} contain irreducible fractions p / q, where p is the number of vertices, and q is their turning number. Equivalently, {p / q} is created from the vertices of {p}, connected every q. For example, {5 ⁄ 2} is a pentagram; {5 ⁄ 1} is a pentagon.

  4. Dodecahedron - Wikipedia

    en.wikipedia.org/wiki/Dodecahedron

    The concave equilateral dodecahedron, called an endo-dodecahedron. [clarification needed] A cube can be divided into a pyritohedron by bisecting all the edges, and faces in alternate directions. A regular dodecahedron is an intermediate case with equal edge lengths. A rhombic dodecahedron is a degenerate case with the 6 crossedges reduced to ...

  5. File:Dodecahedron vertices.svg - Wikipedia

    en.wikipedia.org/wiki/File:Dodecahedron_vertices.svg

    The blue vertices lie at (± ⁠ 1 / ϕ ⁠, 0, ±ϕ) and form a rectangle on the xz-plane. (The red, green and blue coordinate triples are circular permutations of each other.) The distance between adjacent vertices is ⁠ 2 / ϕ ⁠, and the distance from the origin to any vertex is √ 3. ϕ = ⁠ 1 + √ 5 / 2 ⁠ is the golden ratio.

  6. Polyhedral graph - Wikipedia

    en.wikipedia.org/wiki/Polyhedral_graph

    The polyhedral graph formed as the Schlegel diagram of a regular dodecahedron. In geometric graph theory, a branch of mathematics, a polyhedral graph is the undirected graph formed from the vertices and edges of a convex polyhedron. Alternatively, in purely graph-theoretic terms, the polyhedral graphs are the 3-vertex-connected, planar graphs.

  7. Small stellated dodecahedron - Wikipedia

    en.wikipedia.org/wiki/Small_stellated_dodecahedron

    3D model of a small stellated dodecahedron. In geometry, the small stellated dodecahedron is a Kepler-Poinsot polyhedron, named by Arthur Cayley, and with Schläfli symbol {5 ⁄ 2,5}. It is one of four nonconvex regular polyhedra. It is composed of 12 pentagrammic faces, with five pentagrams meeting at each vertex.

  8. Rhombicosidodecahedron - Wikipedia

    en.wikipedia.org/wiki/Rhombicosidodecahedron

    In the mathematical field of graph theory, a rhombicosidodecahedral graph is the graph of vertices and edges of the rhombicosidodecahedron, one of the Archimedean solids. It has 60 vertices and 120 edges, and is a quartic graph Archimedean graph. [5] Square centered Schlegel diagram

  9. Vertex configuration - Wikipedia

    en.wikipedia.org/wiki/Vertex_configuration

    A vertex configuration can also be represented as a polygonal vertex figure showing the faces around the vertex. This vertex figure has a 3-dimensional structure since the faces are not in the same plane for polyhedra, but for vertex-uniform polyhedra all the neighboring vertices are in the same plane and so this plane projection can be used to visually represent the vertex configuration.