Search Results for ""

A chord of a graph cycle C is an edge not in the edge set of C whose endpoints lie in the vertex set C (West 2000, p. 225). For example, in the diamond graph as labeled ...

The cyclic group C_8 is one of the three Abelian groups of the five groups total of group order 8. Examples include the integers modulo 8 under addition (Z_8) and the residue ...

Degen's eight-square identity is the incredible polynomial identity (1) found around 1818 by the Danish mathematician Ferdinand Degen (1766-1825). It was subsequently ...

The Markström graph is a cubic planar graph on 24 vertices which lacks cycles of length 4 and 8 but contains cycles of length 16. (In particular, it contains cycles of ...

For a braid with M strands, R components, P positive crossings, and N negative crossings, {P-N<=U_++M-R if P>=N; P-N<=U_-+M-R if P<=N, (1) where U_+/- are the smallest number ...

Construct a 5×5×5 cube from thirteen 1×2×4 blocks, one 2×2×2 block, one 1×2×2, and three 1×1×3 blocks.

A product of a reflection in a line and translation along the same line.

The dual of the great stellated truncated dodecahedron U_(66) and Wenninger dual W_(104).

The Sierpiński sieve is a fractal described by Sierpiński in 1915 and appearing in Italian art from the 13th century (Wolfram 2002, p. 43). It is also called the Sierpiński ...

Topology