Search Results for ""

A straight line embedding, or "straight line drawing," of a graph is a graph embedding in which all edges are drawn as straight line segments (as opposed to curves, etc.).

The central point in a wheel graph W_n. The hub has degree n-1.

The vertex count of a graph g, commonly denoted V(g) or |g|, is the number of vertices in g. In other words, it is the cardinality of the vertex set. The vertex count of a ...

The augmented dodecahedron is Johnson solid J_(58), which is formed from augmentation of one of the faces of the regular dodecahedron by an equilateral pentagonal pyramid. It ...

A hendecagon is an 11-sided polygon, also variously known as an undecagon or unidecagon. The term "hendecagon" is preferable to the other two since it uses the Greek prefix ...

A heptagon is a seven-sided polygon. It is also sometimes called a septagon, though this usage mixes a Latin prefix sept- (derived from septua-, meaning "seven") with the ...

The degree of a graph vertex v of a graph G is the number of graph edges which touch v. The vertex degrees are illustrated above for a random graph. The vertex degree is also ...

A number of attractive 2-compounds of the regular dodecahedron can be constructed. The first (left figures) has the symmetry of the cube and arises by combining two regular ...

A skew polygon such that every two consecutive sides (but no three) belong to a face of a regular polyhedron. Every regular polyhedron can be orthogonally projected onto a ...

A 32-sided polygon. The regular icosidodecagon is a constructible polygon, and the regular icosidodecahedron of side length 1 has inradius r, circumradius R, and area A r = ...