Vertex-transitive

From Wikipedia, the free encyclopedia

For graph theory, see Vertex-transitive graph.

In geometry, a polyhedron (or tiling) is isogonal or vertex-transitive if all its vertices are the same. That is, each vertex is surrounded by the same kinds of face in the same order, and with the same angles between corresponding faces.

Technically, we say that for any two vertices there exists a symmetry of the polyhedron mapping the first isometrically onto the second. Other ways of saying this are that the polyhedron is transitive on its vertices, or that the vertices lie within a single symmetry orbit.

The term isogonal has long been used for polyhedra. Vertex-transitive is a synonym borrowed from modern ideas such as symmetry groups and graph theory.

Isogonal polyhedra may be classified:

Regular if it is also isohedral (face-transitive) and isotoxal (edge-transitive); this implies that every face is the same kind of regular polygon.
Quasi-regular if it is also isotoxal (edge-transitive) but not isohedral (face-transitive).
Semi-regular if every face is a regular polygon but it is not isohedral (face-transitive). (Definition varies among authors; e.g. some exclude solids with dihedral symmetry, or nonconvex solids.)
Uniform if every face is a regular polygon, i.e. it is regular, quasiregular or semi-regular.
Noble if it is also isohedral (face-transitive).

An isogonal polyhedron has a single kind of vertex figure. If the faces are regular (and the polyhedron is thus uniform) it can be represented by a vertex configuration notation sequencing the faces around each vertex.

These definitions can be extended to higher dimensional polytopes.