When.com Web Search

  1. Ad

    related to: faces vertices and edges worksheet

Search results

  1. Results From The WOW.Com Content Network
  2. Face (geometry) - Wikipedia

    en.wikipedia.org/wiki/Face_(geometry)

    where V is the number of vertices, E is the number of edges, and F is the number of faces. This equation is known as Euler's polyhedron formula. Thus the number of faces is 2 more than the excess of the number of edges over the number of vertices. For example, a cube has 12 edges and 8 vertices, and hence 6 faces.

  3. List of uniform polyhedra by vertex figure - Wikipedia

    en.wikipedia.org/wiki/List_of_uniform_polyhedra...

    The relations can be made apparent by examining the vertex figures obtained by listing the faces adjacent to each vertex (remember that for uniform polyhedra all vertices are the same, that is vertex-transitive). For example, the cube has vertex figure 4.4.4, which is to say, three adjacent square faces. The possible faces are 3 - equilateral ...

  4. Small stellated dodecahedron - Wikipedia

    en.wikipedia.org/wiki/Small_stellated_dodecahedron

    The dodecadodecahedron is a rectification, where edges are truncated down to points. The truncated small stellated dodecahedron can be considered a degenerate uniform polyhedron since edges and vertices coincide, but it is included for completeness. Visually, it looks like a regular dodecahedron on the surface, but it has 24 faces in ...

  5. Vertex (geometry) - Wikipedia

    en.wikipedia.org/wiki/Vertex_(geometry)

    where V is the number of vertices, E is the number of edges, and F is the number of faces. This equation is known as Euler's polyhedron formula. Thus the number of vertices is 2 more than the excess of the number of edges over the number of faces. For example, since a cube has 12 edges and 6 faces, the formula implies that it has eight vertices.

  6. Polyhedral combinatorics - Wikipedia

    en.wikipedia.org/wiki/Polyhedral_combinatorics

    The dimension of a face is the dimension of this hull. The 0-dimensional faces are the vertices themselves, and the 1-dimensional faces (called edges) are line segments connecting pairs of vertices. Note that this definition also includes as faces the empty set and the whole polytope P.

  7. Rhombicosidodecahedron - Wikipedia

    en.wikipedia.org/wiki/Rhombicosidodecahedron

    In geometry, the Rhombicosidodecahedron is an Archimedean solid, one of thirteen convex isogonal nonprismatic solids constructed of two or more types of regular polygon faces. It has 20 regular triangular faces, 30 square faces, 12 regular pentagonal faces, 60 vertices, and 120 edges.

  8. Truncated icosidodecahedron - Wikipedia

    en.wikipedia.org/wiki/Truncated_icosidodecahedron

    In the mathematical field of graph theory, a truncated icosidodecahedral graph (or great rhombicosidodecahedral graph) is the graph of vertices and edges of the truncated icosidodecahedron, one of the Archimedean solids. It has 120 vertices and 180 edges, and is a zero-symmetric and cubic Archimedean graph. [6]

  9. 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] This set of polyhedrons is named after Plato.