Triaugmented triangular prismThe triaugmented triangular prism, in geometry, is a convex polyhedron with 14 equilateral triangles as its faces. It can be constructed from a triangular prism by attaching equilateral square pyramids to each of its three square faces. The same shape is also called the tetrakis triangular prism, tricapped trigonal prism, tetracaidecadeltahedron, or tetrakaidecadeltahedron; these last names mean a polyhedron with 14 triangular faces. It is an example of a deltahedron and of a Johnson solid.
Pentagonal bipyramidIn geometry, the pentagonal bipyramid (or dipyramid) is third of the infinite set of face-transitive bipyramids, and the 13th Johnson solid (J_13). Each bipyramid is the dual of a uniform prism. Although it is face-transitive, it is not a Platonic solid because some vertices have four faces meeting and others have five faces. If the faces are equilateral triangles, it is a deltahedron and a Johnson solid (J13). It can be seen as two pentagonal pyramids (J2) connected by their bases.
Snub (geometry)In geometry, a snub is an operation applied to a polyhedron. The term originates from Kepler's names of two Archimedean solids, for the snub cube (cubus simus) and snub dodecahedron (dodecaedron simum). In general, snubs have chiral symmetry with two forms: with clockwise or counterclockwise orientation. By Kepler's names, a snub can be seen as an expansion of a regular polyhedron: moving the faces apart, twisting them about their centers, adding new polygons centered on the original vertices, and adding pairs of triangles fitting between the original edges.
Triangular bipyramidIn geometry, the triangular bipyramid (or dipyramid) is a type of hexahedron, being the first in the infinite set of face-transitive bipyramids. It is the dual of the triangular prism with 6 isosceles triangle faces. As the name suggests, it can be constructed by joining two tetrahedra along one face. Although all its faces are congruent and the solid is face-transitive, it is not a Platonic solid because some vertices adjoin three faces and others adjoin four.
DeltahedronIn geometry, a deltahedron (plural deltahedra) is a polyhedron whose faces are all equilateral triangles. The name is taken from the Greek upper case delta (Δ), which has the shape of an equilateral triangle. There are infinitely many deltahedra, all having an even number of faces by the handshaking lemma. Of these only eight are convex, having 4, 6, 8, 10, 12, 14, 16 and 20 faces. The number of faces, edges, and vertices is listed below for each of the eight convex deltahedra.
Snub square antiprismIn geometry, the snub square antiprism is one of the Johnson solids (J_85). It is one of the elementary Johnson solids that do not arise from "cut and paste" manipulations of the Platonic and Archimedean solids, although it is a relative of the icosahedron that has fourfold symmetry instead of threefold. The snub square antiprism is constructed as its name suggests, a square antiprism which is snubbed, and represented as ss{2,8}, with s{2,8} as a square antiprism. It can be constructed in Conway polyhedron notation as sY4 (snub square pyramid).
Square antiprismIn geometry, the square antiprism is the second in an infinite family of antiprisms formed by an even-numbered sequence of triangle sides closed by two polygon caps. It is also known as an anticube. If all its faces are regular, it is a semiregular polyhedron or uniform polyhedron. A nonuniform D4-symmetric variant is the cell of the noble square antiprismatic 72-cell. When eight points are distributed on the surface of a sphere with the aim of maximising the distance between them in some sense, the resulting shape corresponds to a square antiprism rather than a cube.
Simplicial polytopeIn geometry, a simplicial polytope is a polytope whose facets are all simplices. For example, a simplicial polyhedron in three dimensions contains only triangular faces and corresponds via Steinitz's theorem to a maximal planar graph. They are topologically dual to simple polytopes. Polytopes which are both simple and simplicial are either simplices or two-dimensional polygons. Simplicial polyhedra include: Bipyramids Gyroelongated dipyramids Deltahedra (equilateral triangles) Platonic tetrahedron, octahed
Uniform polyhedronIn geometry, a uniform polyhedron has regular polygons as faces and is vertex-transitive (i.e., there is an isometry mapping any vertex onto any other). It follows that all vertices are congruent. Uniform polyhedra may be regular (if also face- and edge-transitive), quasi-regular (if also edge-transitive but not face-transitive), or semi-regular (if neither edge- nor face-transitive). The faces and vertices need not be convex, so many of the uniform polyhedra are also star polyhedra.
Well-covered graphIn graph theory, a well-covered graph is an undirected graph in which every minimal vertex cover has the same size as every other minimal vertex cover. Equivalently, these are the graphs in which all maximal independent sets have equal size. Well-covered graphs were defined and first studied by Michael D. Plummer in 1970. The well-covered graphs include all complete graphs, balanced complete bipartite graphs, and the rook's graphs whose vertices represent squares of a chessboard and edges represent moves of a chess rook.
