HOME

TheInfoList



OR:

In
topological graph theory In mathematics, topological graph theory is a branch of graph theory. It studies the embedding of graphs in surfaces, spatial embeddings of graphs, and graphs as topological spaces. It also studies immersions of graphs. Embedding a graph in ...
, the Petrie dual of an embedded graph (on a 2-
manifold In mathematics, a manifold is a topological space that locally resembles Euclidean space near each point. More precisely, an n-dimensional manifold, or ''n-manifold'' for short, is a topological space with the property that each point has a n ...
with all faces disks) is another embedded graph that has the
Petrie polygon In geometry, a Petrie polygon for a regular polytope of dimensions is a skew polygon in which every consecutive sides (but no ) belongs to one of the facets. The Petrie polygon of a regular polygon is the regular polygon itself; that of a reg ...
s of the first embedding as its faces. The Petrie dual is also called the Petrial, and the Petrie dual of an embedded graph G may be denoted G^\pi. It can be obtained from a signed rotation system or ribbon graph representation of the embedding by twisting every edge of the embedding.


Properties

Like the usual
dual graph In the mathematical discipline of graph theory, the dual graph of a plane graph is a graph that has a vertex for each face of . The dual graph has an edge for each pair of faces in that are separated from each other by an edge, and a self-loop ...
, 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. Surface duality and Petrie duality are two of the six Wilson operations, and together generate the group of these operations.


Regular polyhedra

Applying the Petrie dual to a
regular polyhedron 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 equival ...
produces a regular map. The number of skew ''h''-gonal faces is ''g''/2''h'', where ''g'' is the
group order In mathematics, the order of a finite group is the number of its elements. If a group (mathematics), group is not finite, one says that its order is ''infinite''. The ''order'' of an element of a group (also called period length or period) is t ...
, and ''h'' is the
coxeter number In mathematics, the Coxeter number ''h'' is the order of a Coxeter element of an irreducible Coxeter group. It is named after H.S.M. Coxeter. Definitions Note that this article assumes a finite Coxeter group. For infinite Coxeter groups, there a ...
of the group. For example, the Petrie dual of a cube (a
bipartite graph In the mathematical field of graph theory, a bipartite graph (or bigraph) is a graph whose vertices can be divided into two disjoint and independent sets U and V, that is every edge connects a vertex in U to one in V. Vertex sets U and V are ...
with eight vertices and twelve edges, embedded onto a sphere with six square faces) has fourOctahedral symmetry is order 48, Coxeter number is 6, 48/(2×6)=4 hexagonal faces, the equators of the cube. Topologically, it forms an embedding of the same graph onto a torus. The regular maps obtained in this way are as follows. * The ''petrial tetrahedron'', , has 4 vertices, 6 edges, and 3 skew square faces. With an
Euler characteristic In mathematics, and more specifically in algebraic topology and polyhedral combinatorics, the Euler characteristic (or Euler number, or Euler–Poincaré characteristic) is a topological invariant, a number that describes a topological space ...
, ''χ'', of 1, it is topologically identical to the hemi-cube, /2. * The ''petrial cube'', , has 8 vertices, 12 edges, and 4 skew hexagons, colored red, green, blue and orange here. With an Euler characteristic of 0, it can also be seen in the four hexagonal faces of the hexagonal tiling as type (2,0). * The ''petrial octahedron'', , has 6 vertices, 12 edges, and 4 skew hexagon faces. It has an Euler characteristic of −2, and has a mapping to the hyperbolic
order-4 hexagonal tiling In geometry, the order-4 hexagonal tiling is a regular tiling of the hyperbolic plane. It has Schläfli symbol of . Symmetry This tiling represents a hyperbolic kaleidoscope of 6 mirrors defining a regular hexagon fundamental domain. This sym ...
, as type 3. * The ''petrial dodecahedron'', , has 20 vertices, 30 edges, and 6 skew decagonal faces, and Euler characteristic of −4, related to the hyperbolic tiling as type 5. * The ''petrial icosahedron'', , has 12 vertices, 30 edges, and 6 skew decagonal faces, and Euler characteristic of −12, related to the hyperbolic tiling as type 3. There are also 4 petrials of the Kepler–Poinsot polyhedra: * The ''petrial great dodecahedron'', , has 12 vertices, 30 edges, and 10 skew hexagon faces with an
Euler characteristic In mathematics, and more specifically in algebraic topology and polyhedral combinatorics, the Euler characteristic (or Euler number, or Euler–Poincaré characteristic) is a topological invariant, a number that describes a topological space ...
, ''χ'', of -8. * The ''petrial small stellated dodecahedron'', , has 12 vertices, 30 edges, and 10 skew hexagon faces with ''χ'' of -8. * The ''petrial great icosahedron'', , has 12 vertices, 30 edges, and 6 skew decagram faces with ''χ'' of -12. * The ''petrial great stellated dodecahedron'', , has 20 vertices, 30 edges, and 6 skew decagram faces with ''χ'' of -4.


References

{{reflist, refs= {{citation, title=Abstract Regular Polytopes, volume=92, series=Encyclopedia of Mathematics and its Applications, first1=Peter, last1=McMullen, first2=Egon, last2=Schulte, publisher=Cambridge University Press, year=2002, isbn=9780521814966, page=192, url=https://books.google.com/books?id=JfmlMYe6MJgC&pg=PA192 {{citation, title=Geometry at Work, series=MAA Notes, volume=53, first=Catherine A., last=Gorini, publisher=Cambridge University Press, year=2000, isbn=9780883851647, page=181, url=https://books.google.com/books?id=Eb6uSLa2k6IC&pg=PA181 {{citation , last1 = Jones , first1 = G. A. , last2 = Thornton , first2 = J. S. , issue = 2 , journal =
Journal of Combinatorial Theory The ''Journal of Combinatorial Theory'', Series A and Series B, are mathematical journals specializing in combinatorics and related areas. They are published by Elsevier. ''Series A'' is concerned primarily with structures, designs, and applicat ...
, mr = 733017 , pages = 93–103 , series = Series B , title = Operations on maps, and outer automorphisms , doi = 10.1016/0095-8956(83)90065-5 , volume = 35 , year = 1983, doi-access = free
Topological graph theory