When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Cube - Wikipedia

    en.wikipedia.org/wiki/Cube

    It has the same number of vertices and edges as the cube, twelve vertices and eight edges. [ 29 ] The cubical graph is a special case of hypercube graph or n {\displaystyle n} - cube—denoted as Q n {\displaystyle Q_{n}} —because it can be constructed by using the operation known as the Cartesian product of graphs .

  3. Euler characteristic - Wikipedia

    en.wikipedia.org/wiki/Euler_characteristic

    Vertex, edge and face of a cube. The Euler characteristic χ was classically defined for the surfaces of polyhedra, according to the formula = + where V, E, and F are respectively the numbers of vertices (corners), edges and faces in the given polyhedron.

  4. Hypercube - Wikipedia

    en.wikipedia.org/wiki/Hypercube

    In geometry, a hypercube is an n-dimensional analogue of a square (n = 2) and a cube (n = 3); the special case for n = 4 is known as a tesseract.It is a closed, compact, convex figure whose 1-skeleton consists of groups of opposite parallel line segments aligned in each of the space's dimensions, perpendicular to each other and of the same length.

  5. Hypercube graph - Wikipedia

    en.wikipedia.org/wiki/Hypercube_graph

    The graph Q 0 consists of a single vertex, while Q 1 is the complete graph on two vertices. Q 2 is a cycle of length 4. The graph Q 3 is the 1-skeleton of a cube and is a planar graph with eight vertices and twelve edges. The graph Q 4 is the Levi graph of the Möbius configuration. It is also the knight's graph for a toroidal chessboard.

  6. 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.

  7. Edge (geometry) - Wikipedia

    en.wikipedia.org/wiki/Edge_(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 edges is 2 less than the sum of the numbers of vertices and faces. For example, a cube has 8 vertices and 6 faces, and hence 12 edges.

  8. 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.

  9. Tesseract - Wikipedia

    en.wikipedia.org/wiki/Tesseract

    In geometry, a tesseract or 4-cube is a four-dimensional hypercube, analogous to a two-dimensional square and a three-dimensional cube. [1] Just as the perimeter of the square consists of four edges and the surface of the cube consists of six square faces, the hypersurface of the tesseract consists of eight cubical cells, meeting at right angles.