Antiprism graph

Last updated

In the mathematical field of graph theory, an antiprism graph is a graph that has one of the antiprisms as its skeleton. An n-sided antiprism has 2n vertices and 4n edges. They are regular, polyhedral (and therefore by necessity also 3-vertex-connected, vertex-transitive, and planar graphs), and also Hamiltonian graphs. [1]

Contents

Examples

The first graph in the sequence, the octahedral graph, has 6 vertices and 12 edges. Later graphs in the sequence may be named after the type of antiprism they correspond to:

3-cube t2.svg
3
Square antiprismatic graph.png
4
Pentagonal antiprismatic graph.png
5
Hexagonal antiprismatic graph.png
6
Heptagonal antiprism graph.png
7
Octagonal antiprismatic graph.png
8

Although geometrically the star polygons also form the faces of a different sequence of (self-intersecting) antiprisms, the star antiprisms, they do not form a different sequence of graphs.

An antiprism graph is a special case of a circulant graph, Ci2n(2,1).

Other infinite sequences of polyhedral graph formed in a similar way from polyhedra with regular-polygon bases include the prism graphs (graphs of prisms) and wheel graphs (graphs of pyramids). Other vertex-transitive polyhedral graphs include the Archimedean graphs.

Related Research Articles

Archimedean solid Polyhedra in which all vertices are the same

In geometry, an Archimedean solid is one of the 13 solids first enumerated by Archimedes. They are the convex uniform polyhedra composed of regular polygons meeting in identical vertices, excluding the five Platonic solids, excluding the prisms and antiprisms, and excluding the pseudorhombicuboctahedron. They are a subset of the Johnson solids, whose regular polygonal faces do not need to meet in identical vertices.

Antiprism Polyhedron with parallel bases connected by triangles

In geometry, an n-gonal antiprism or n-antiprism is a polyhedron composed of two parallel direct copies of an n-sided polygon, connected by an alternating band of 2n triangles. They are represented by the Conway notation An.

Octahedron Polyhedron with 8 triangular faces

In geometry, an octahedron is a polyhedron with eight faces. The term is most commonly used to refer to the regular octahedron, a Platonic solid composed of eight equilateral triangles, four of which meet at each vertex.

Polyhedron 3D shape with flat faces, straight edges and sharp corners

In geometry, a polyhedron is a three-dimensional shape with flat polygonal faces, straight edges and sharp corners or vertices.

A polyhedral compound is a figure that is composed of several polyhedra sharing a common centre. They are the three-dimensional analogs of polygonal compounds such as the hexagram.

4-polytope Four-dimensional geometric object with flat sides

In geometry, a 4-polytope is a four-dimensional polytope. It is a connected and closed figure, composed of lower-dimensional polytopal elements: vertices, edges, faces (polygons), and cells (polyhedra). Each face is shared by exactly two cells. The 4-polytopes were discovered by the Swiss mathematician Ludwig Schläfli before 1853.

Rhombicuboctahedron Archimedean solid with 26 faces

In geometry, the rhombicuboctahedron, or small rhombicuboctahedron, is an Archimedean solid with eight triangular, six square, and twelve rectangular faces. There are 24 identical vertices, with one triangle, one square, and two rectangles meeting at each one. The polyhedron has octahedral symmetry, like the cube and octahedron. Its dual is called the deltoidal icositetrahedron or trapezoidal icositetrahedron, although its faces are not really true trapezoids.

Truncated icosidodecahedron Archimedean solid

In geometry, the truncated icosidodecahedron is an Archimedean solid, one of thirteen convex, isogonal, non-prismatic solids constructed by two or more types of regular polygon faces.

Uniform 4-polytope Class of 4-dimensional polytopes

In geometry, a uniform 4-polytope is a 4-dimensional polytope which is vertex-transitive and whose cells are uniform polyhedra, and faces are regular polygons.

Uniform polyhedron Isogonal polyhedron with regular faces

In geometry, a uniform polyhedron has regular polygons as faces and is vertex-transitive. It follows that all vertices are congruent.

Cubic honeycomb Only regular space-filling tessellation of the cube

The cubic honeycomb or cubic cellulation is the only proper regular space-filling tessellation in Euclidean 3-space made up of cubic cells. It has 4 cubes around every edge, and 8 cubes around each vertex. Its vertex figure is a regular octahedron. It is a self-dual tessellation with Schläfli symbol {4,3,4}. John Horton Conway called this honeycomb a cubille.

Tetrahedral-octahedral honeycomb Quasiregular space-filling tesselation

The tetrahedral-octahedral honeycomb, alternated cubic honeycomb is a quasiregular space-filling tessellation in Euclidean 3-space. It is composed of alternating regular octahedra and tetrahedra in a ratio of 1:2.

Apeirogon Polygon with infinitely many sides

In geometry, an apeirogon or infinite polygon is a generalized polygon with a countably infinite number of sides. Apeirogons are the two-dimensional case of infinite polytopes.

Skew polygon Polygon whose vertices are not all coplanar

In geometry, a skew polygon is a polygon whose vertices are not all coplanar. Skew polygons must have at least four vertices. The interior surface of such a polygon is not uniquely defined.

Uniform polytope Isogonal polytope with uniform facets

In geometry, a uniform polytope of dimension three or higher is a vertex-transitive polytope bounded by uniform facets. The uniform polytopes in two dimensions are the regular polygons.

In geometry, a uniform tiling is a tessellation of the plane by regular polygon faces with the restriction of being vertex-transitive.

Platonic graph Graph with a Platonic solid as its skeleton

In the mathematical field of graph theory, a Platonic graph is a graph that has one of the Platonic solids as its skeleton. There are 5 Platonic graphs, and all of them are regular, polyhedral, and also Hamiltonian graphs.

In the mathematical field of graph theory, a prism graph is a graph that has one of the prisms as its skeleton.

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.

References

  1. Read, R. C. and Wilson, R. J. An Atlas of Graphs, Oxford, England: Oxford University Press, 2004 reprint, Chapter 6 special graphs pp. 261, 270.