In topological graph theory, the Petrie dual of an embedded graph (on a 2-manifold with all faces disks) is another embedded graph that has the Petrie polygons of the first embedding as its faces. [1]
The Petrie dual is also called the Petrial, and the Petrie dual of an embedded graph may be denoted . [2] It can be obtained from a signed rotation system or ribbon graph representation of the embedding by twisting every edge of the embedding.
Like the usual dual graph, repeating the Petrie dual operation twice returns to the original surface embedding. Unlike the usual dual graph (which is an embedding of a generally different graph in the same surface) the Petrie dual is an embedding of the same graph in a generally different surface. [1]
Surface duality and Petrie duality are two of the six Wilson operations, and together generate the group of these operations. [3]
Applying the Petrie dual to a regular polyhedron produces a regular map. [2] The number of skew h-gonal faces is g/2h, where g is the group order, and h is the coxeter number of the group.
For example, the Petrie dual of a cube (a bipartite graph with eight vertices and twelve edges, embedded onto a sphere with six square faces) has four [4] hexagonal faces, the equators of the cube. Topologically, it forms an embedding of the same graph onto a torus. [1]
The regular maps obtained in this way are as follows.
Name | Petrial tetrahedron | Petrial cube | Petrial octahedron | Petrial dodecahedron | Petrial icosahedron |
---|---|---|---|---|---|
Symbol | {3,3}π , {4,3}3 | {4,3}π , {6,3}4 | {3,4}π , {6,4}3 | {5,3}π , {10,3} | {3,5}π , {10,5} |
(v,e,f), χ | (4,6,3), χ = 1 | (8,12,4), χ = 0 | (6,12,4), χ = −2 | (20,30,6), χ = −4 | (12,30,6), χ = −12 |
Faces | 3 skew squares | 4 skew hexagons | 6 skew decagons | ||
Image | |||||
Animation | |||||
Related figures | {4,3}3 = {4,3}/2 = {4,3}(2,0) | {6,3}3 = {6,3}(2,0) | {6,4}3 = {6,4}(4,0) | {10,3}5 | {10,5}3 |
There are also 4 petrials of the Kepler–Poinsot polyhedra:
Name | Petrial great dodecahedron | Petrial small stellated dodecahedron | Petrial great icosahedron | Petrial great stellated dodecahedron |
---|---|---|---|---|
Symbol | {5,5/2}π , {6,5/2} | {5/2,5}π , {6,5} | {3,5/2}π , {10/3,5/2} | {5/2,3}π , {10/3,3} |
(v,e,f), χ | (12,30,10), χ = -8 | (12,30,10), χ = -8 | (12,30,6), χ = -12 | (20,30,6), χ = -4 |
Faces | 10 skew hexagons | 6 skew decagrams (one blue decagram outlined) | ||
Image | ||||
Animation |
A cuboctahedron is a polyhedron with 8 triangular faces and 6 square faces. A cuboctahedron has 12 identical vertices, with 2 triangles and 2 squares meeting at each, and 24 identical edges, each separating a triangle from a square. As such, it is a quasiregular polyhedron, i.e. an Archimedean solid that is not only vertex-transitive but also edge-transitive. It is the only radially equilateral convex polyhedron.
In geometry, a cube is a three-dimensional solid object bounded by six square faces, facets or sides, with three meeting at each vertex.
In geometry, a dodecahedron or duodecahedron is any polyhedron with twelve flat faces. The most familiar dodecahedron is the regular dodecahedron with regular pentagons as faces, which is a Platonic solid. There are also three regular star dodecahedra, which are constructed as stellations of the convex form. All of these have icosahedral symmetry, order 120.
In geometry, any polyhedron is associated with a second dual figure, where the vertices of one correspond to the faces of the other, and the edges between pairs of vertices of one correspond to the edges between pairs of faces of the other. Such dual figures remain combinatorial or abstract polyhedra, but not all are also geometric polyhedra. Starting with any given polyhedron, the dual of its dual is the original polyhedron.
In geometry, a regular icosahedron is a convex polyhedron with 20 faces, 30 edges and 12 vertices. It is one of the five Platonic solids, and the one with the most faces.
In geometry, a polyhedron is a three-dimensional shape with flat polygonal faces, straight edges and sharp corners or vertices. The word polyhedron comes from the Classical Greek πολύεδρον, as poly- + -hedron.
In mathematics, and more specifically in algebraic topology and polyhedral combinatorics, the Euler characteristic is a topological invariant, a number that describes a topological space's shape or structure regardless of the way it is bent. It is commonly denoted by .
In geometry, a decagon is a ten-sided polygon or 10-gon. The total sum of the interior angles of a simple decagon is 1440°.
A regular polyhedron is a polyhedron whose symmetry group acts transitively on its flags. A regular polyhedron is highly symmetrical, being all of edge-transitive, vertex-transitive and face-transitive. In classical contexts, many different equivalent definitions are used; a common one is that the faces are congruent regular polygons which are assembled in the same way around each vertex.
In geometry, the truncated dodecahedron is an Archimedean solid. It has 12 regular decagonal faces, 20 regular triangular faces, 60 vertices and 90 edges.
In the mathematical discipline of graph theory, the dual graph of a plane graph G is a graph that has a vertex for each face of G. The dual graph has an edge for each pair of faces in G that are separated from each other by an edge, and a self-loop when the same face appears on both sides of an edge. Thus, each edge e of G has a corresponding dual edge, whose endpoints are the dual vertices corresponding to the faces on either side of e. The definition of the dual depends on the choice of embedding of the graph G, so it is a property of plane graphs rather than planar graphs. For planar graphs generally, there may be multiple dual graphs, depending on the choice of planar embedding of the graph.
In geometry, Conway polyhedron notation, invented by John Horton Conway and promoted by George W. Hart, is used to describe polyhedra based on a seed polyhedron modified by various prefix operations.
In geometry, a honeycomb is a space filling or close packing of polyhedral or higher-dimensional cells, so that there are no gaps. It is an example of the more general mathematical tiling or tessellation in any number of dimensions. Its dimension can be clarified as n-honeycomb for a honeycomb of n-dimensional space.
In geometry, a Petrie polygon for a regular polytope of n dimensions is a skew polygon in which every (n – 1) consecutive sides belongs to one of the facets. The Petrie polygon of a regular polygon is the regular polygon itself; that of a regular polyhedron is a skew polygon such that every two consecutive side belongs to one of the faces. Petrie polygons are named for mathematician John Flinders Petrie.
In mathematics, a regular map is a symmetric tessellation of a closed surface. More precisely, a regular map is a decomposition of a two-dimensional manifold into topological disks such that every flag can be transformed into any other flag by a symmetry of the decomposition. Regular maps are, in a sense, topological generalizations of Platonic solids. The theory of maps and their classification is related to the theory of Riemann surfaces, hyperbolic geometry, and Galois theory. Regular maps are classified according to either: the genus and orientability of the supporting surface, the underlying graph, or the automorphism group.
In geometry, a toroidal polyhedron is a polyhedron which is also a toroid, having a topological genus of 1 or greater. Notable examples include the Császár and Szilassi polyhedra.
In geometry, the density of a star polyhedron is a generalization of the concept of winding number from two dimensions to higher dimensions, representing the number of windings of the polyhedron around the center of symmetry of the polyhedron. It can be determined by passing a ray from the center to infinity, passing only through the facets of the polytope and not through any lower dimensional features, and counting how many facets it passes through. For polyhedra for which this count does not depend on the choice of the ray, and for which the central point is not itself on any facet, the density is given by this count of crossed facets.
In geometry, an infinite skew polygon or skew apeirogon is an infinite 2-polytope with vertices that are not all colinear. Infinite zig-zag skew polygons are 2-dimensional infinite skew polygons with vertices alternating between two parallel lines. Infinite helical polygons are 3-dimensional infinite skew polygons with vertices on the surface of a cylinder.
In three-dimensional hyperbolic geometry, an ideal polyhedron is a convex polyhedron all of whose vertices are ideal points, points "at infinity" rather than interior to three-dimensional hyperbolic space. It can be defined as the convex hull of a finite set of ideal points. An ideal polyhedron has ideal polygons as its faces, meeting along lines of the hyperbolic space.