In geometry and polyhedral combinatorics, the Kleetope of a polyhedron or higher-dimensional convex polytope is another polyhedron or polytope formed by replacing each facet of with a shallow pyramid. Kleetopes are named after Victor Klee. Examples The triakis tetrahedron is the Kleetope of a tetrahedron, the triakis octahedron is the Kleetope of an octahedron, and the triakis icosahedron is the Kleetope of an icosahedron. In each of these cases the Kleetope is formed by adding a triangular pyramid to each face of the original polyhedron. The tetrakis hexahedron is the Kleetope of the cube, formed by adding a square pyramid to each of its faces, and the pentakis dodecahedron is the Kleetope of the dodecahedron, formed by adding a pentagonal pyramid to each face of the dodecahedron. The base polyhedron of a Kleetope does not need to be a Platonic solid. For instance, the disdyakis dodecahedron is the Kleetope of the rhombic dodecahedron, formed by replacing each rhombus face of the dodecahedron by a rhombic pyramid, and the disdyakis triacontahedron is the Kleetope of the rhombic triacontahedron. In fact, the base polyhedron of a Kleetope does not need to be Face-transitive, as can be seen from the tripentakis icosidodecahedron above. The Goldner–Harary graph may be represented as the graph of vertices and edges of the Kleetope of the triangular bipyramid. Definitions One method of forming the Kleetope of a polytope is to place a new vertex outside , near the centroid of each facet. If all of these new vertices are placed close enough to the corresponding centroids, then the only other vertices visible to them will be the vertices of the facets from which they are defined. In this case, the Kleetope of is the convex hull of the union of the vertices of and the set of new vertices. Alternatively, the Kleetope may be defined by duality and its dual operation, truncation: the Kleetope of is the dual polyhedron of the truncation of the dual of . Properties and applications If has enough vertices relative to its dimension, then the Kleetope of is dimensionally unambiguous: the graph formed by its edges and vertices is not the graph of a different polyhedron or polytope with a different dimension. More specifically, if the number of vertices of a -dimensional polytope is at least , then is dimensionally unambiguous. If every -dimensional face of a -dimensional polytope is a simplex, and