Search Results for ""

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 = ...

Two graphs which contain the same number of graph vertices connected in the same way are said to be isomorphic. Formally, two graphs G and H with graph vertices ...

König's line coloring theorem states that the edge chromatic number of any bipartite graph equals its maximum vertex degree. In other words, every bipartite graph is a class ...

The edge connectivity, also called the line connectivity, of a graph is the minimum number of edges lambda(G) whose deletion from a graph G disconnects G. In other words, it ...