- A polygon is bounded by edges; this square has 4 edges.
- Every edge is shared by three or more faces in a 4-polytope, as seen in this projection of a tesseract.

In geometry, an **edge** is a particular type of line segment joining two vertices in a polygon, polyhedron, or higher-dimensional polytope.^{ [1] } In a polygon, an edge is a line segment on the boundary,^{ [2] } and is often called a **polygon side**. In a polyhedron or more generally a polytope, an edge is a line segment where two faces (or polyhedron sides) meet.^{ [3] } A segment joining two vertices while passing through the interior or exterior is not an edge but instead is called a diagonal.

In graph theory, an edge is an abstract object connecting two graph vertices, unlike polygon and polyhedron edges which have a concrete geometric representation as a line segment. However, any polyhedron can be represented by its skeleton or edge-skeleton, a graph whose vertices are the geometric vertices of the polyhedron and whose edges correspond to the geometric edges.^{ [4] } Conversely, the graphs that are skeletons of three-dimensional polyhedra can be characterized by Steinitz's theorem as being exactly the 3-vertex-connected planar graphs.^{ [5] }

Any convex polyhedron's surface has Euler characteristic

where *V* is the number of vertices, *E* is the number of edges, and *F* is the number of faces. This equation is known as Euler's polyhedron formula. Thus the number of edges is 2 less than the sum of the numbers of vertices and faces. For example, a cube has 8 vertices and 6 faces, and hence 12 edges.

In a polygon, two edges meet at each vertex; more generally, by Balinski's theorem, at least *d* edges meet at every vertex of a *d*-dimensional convex polytope.^{ [6] } Similarly, in a polyhedron, exactly two two-dimensional faces meet at every edge,^{ [7] } while in higher dimensional polytopes three or more two-dimensional faces meet at every edge.

In the theory of high-dimensional convex polytopes, a facet or *side* of a *d*-dimensional polytope is one of its (*d* − 1)-dimensional features, a ridge is a (*d* − 2)-dimensional feature, and a peak is a (*d* − 3)-dimensional feature. Thus, the edges of a polygon are its facets, the edges of a 3-dimensional convex polyhedron are its ridges, and the edges of a 4-dimensional polytope are its peaks.^{ [8] }

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, every 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 **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 elementary geometry, a **polytope** is a geometric object with "flat" sides. It is a generalization in any number of dimensions of the three-dimensional polyhedron. Polytopes may exist in any general number of dimensions *n* as an *n*-dimensional polytope or ** n-polytope**. In this context, "flat sides" means that the sides of a (

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.

In solid geometry, a **face** is a flat surface that forms part of the boundary of a solid object; a three-dimensional solid bounded exclusively by faces is a polyhedron.

In geometry, a polytope is **isogonal** or **vertex-transitive** if all its vertices are equivalent under the symmetries of the figure. This implies that each vertex is surrounded by the same kinds of face in the same or reverse order, and with the same angles between corresponding faces.

In geometry, a **vertex figure**, broadly speaking, is the figure exposed when a corner of a polyhedron or polytope is sliced off.

In geometry, a **net** of a polyhedron is an arrangement of non-overlapping edge-joined polygons in the plane which can be folded to become the faces of the polyhedron. Polyhedral nets are a useful aid to the study of polyhedra and solid geometry in general, as they allow for physical models of polyhedra to be constructed from material such as thin cardboard.

A **convex polytope** is a special case of a polytope, having the additional property that it is also a convex set contained in the -dimensional Euclidean space . Most texts use the term "polytope" for a bounded convex polytope, and the word "polyhedron" for the more general, possibly unbounded object. Others allow polytopes to be unbounded. The terms "bounded/unbounded convex polytope" will be used below whenever the boundedness is critical to the discussed issue. Yet other texts identify a convex polytope with its boundary.

In Euclidean geometry, **rectification**, also known as **critical truncation** or **complete-truncation** is the process of truncating a polytope by marking the midpoints of all its edges, and cutting off its vertices at those points. The resulting polytope will be bounded by vertex figure facets and the rectified facets of the original polytope.

**Geometric graph theory** in the broader sense is a large and amorphous subfield of graph theory, concerned with graphs defined by geometric means. In a stricter sense, geometric graph theory studies combinatorial and geometric properties of geometric graphs, meaning graphs drawn in the Euclidean plane with possibly intersecting straight-line edges, and topological graphs, where the edges are allowed to be arbitrary continuous curves connecting the vertices, thus it is "the theory of geometric and topological graphs". Geometric graphs are also known as spatial networks.

In geometry, a polytope of dimension 3 or higher is **isohedral** or **face-transitive** when all its faces are the same. More specifically, all faces must be not merely congruent but must be *transitive*, i.e. must lie within the same *symmetry orbit*. In other words, for any faces *A* and *B*, there must be a symmetry of the *entire* solid by rotations and reflections that maps *A* onto *B*. For this reason, convex isohedral polyhedra are the shapes that will make fair dice.

In geometry, a **Schlegel diagram** is a projection of a polytope from into through a point just outside one of its facets. The resulting entity is a polytopal subdivision of the facet in that, together with the original facet, is combinatorially equivalent to the original polytope. The diagram is named for Victor Schlegel, who in 1886 introduced this tool for studying combinatorial and topological properties of polytopes. In dimension 3, a Schlegel diagram is a projection of a polyhedron into a plane figure; in dimension 4, it is a projection of a 4-polytope to 3-space. As such, Schlegel diagrams are commonly used as a means of visualizing four-dimensional polytopes.

In geometry, a **vertex**, often denoted by letters such as , , , , is a point where two or more curves, lines, or edges meet. As a consequence of this definition, the point where two lines meet to form an angle and the corners of polygons and polyhedra are vertices.

**Polyhedral combinatorics** is a branch of mathematics, within combinatorics and discrete geometry, that studies the problems of counting and describing the faces of convex polyhedra and higher-dimensional convex polytopes.

In polyhedral combinatorics, a branch of mathematics, **Steinitz's theorem** is a characterization of the undirected graphs formed by the edges and vertices of three-dimensional convex polyhedra: they are exactly the 3-vertex-connected planar graphs. That is, every convex polyhedron forms a 3-connected planar graph, and every 3-connected planar graph can be represented as the graph of a convex polyhedron. For this reason, the 3-connected planar graphs are also known as polyhedral graphs.

In geometric graph theory, a branch of mathematics, a **polyhedral graph** is the undirected graph formed from the vertices and edges of a convex polyhedron. Alternatively, in purely graph-theoretic terms, the polyhedral graphs are the 3-vertex-connected planar graphs.

In polyhedral combinatorics, a branch of mathematics, **Balinski's theorem** is a statement about the graph-theoretic structure of three-dimensional convex polyhedra and higher-dimensional convex polytopes. It states that, if one forms an undirected graph from the vertices and edges of a convex *d*-dimensional convex polyhedron or polytope, then the resulting graph is at least *d*-vertex-connected: the removal of any *d* − 1 vertices leaves a connected subgraph. For instance, for a three-dimensional polyhedron, even if two of its vertices are removed, for any pair of vertices there will still exist a path of vertices and edges connecting the pair.

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.

- ↑ Ziegler, Günter M. (1995),
*Lectures on Polytopes*, Graduate Texts in Mathematics,**152**, Springer, Definition 2.1, p. 51. - ↑ Weisstein, Eric W. "Polygon Edge." From MathWorld--A Wolfram Web Resource. http://mathworld.wolfram.com/PolygonEdge.html
- ↑ Weisstein, Eric W. "Polytope Edge." From MathWorld--A Wolfram Web Resource. http://mathworld.wolfram.com/PolytopeEdge.html
- ↑ Senechal, Marjorie (2013),
*Shaping Space: Exploring Polyhedra in Nature, Art, and the Geometrical Imagination*, Springer, p. 81, ISBN 9780387927145 . - ↑ Pisanski, Tomaž; Randić, Milan (2000), "Bridges between geometry and graph theory", in Gorini, Catherine A. (ed.),
*Geometry at work*, MAA Notes,**53**, Washington, DC: Math. Assoc. America, pp. 174–194, MR 1782654 . See in particular Theorem 3, p. 176. - ↑ Balinski, M. L. (1961), "On the graph structure of convex polyhedra in
*n*-space",*Pacific Journal of Mathematics*,**11**(2): 431–434, doi: 10.2140/pjm.1961.11.431 , MR 0126765 . - ↑ Wenninger, Magnus J. (1974),
*Polyhedron Models*, Cambridge University Press, p. 1, ISBN 9780521098595 . - ↑ Seidel, Raimund (1986), "Constructing higher-dimensional convex hulls at logarithmic cost per face",
*Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing (STOC '86)*, pp. 404–413, doi:10.1145/12130.12172 .

This page is based on this Wikipedia article

Text is available under the CC BY-SA 4.0 license; additional terms may apply.

Images, videos and audio are available under their respective licenses.

Text is available under the CC BY-SA 4.0 license; additional terms may apply.

Images, videos and audio are available under their respective licenses.