Search Results for ""

A Sierpiński number of the second kind is a number k satisfying Sierpiński's composite number theorem, i.e., a Proth number k such that k·2^n+1 is composite for every n>=1. ...

A simple graph, also called a strict graph (Tutte 1998, p. 2), is an unweighted, undirected graph containing no graph loops or multiple edges (Gibbons 1985, p. 2; West 2000, ...

The Thue-Morse sequence, also called the Morse-Thue sequence or Prouhet-Thue-Morse sequence (Allouche and Cosnard 2000), is one of a number of related sequences of numbers ...

A tree is a mathematical structure that can be viewed as either a graph or as a data structure. The two views are equivalent, since a tree data structure contains not only a ...

The Kummer graph is the name apparently first adopted here for the Levi graph of Kummer's 16_6 configuration (Coxeter 1950), corresponding to the folded 6-cube graph (Brouwer ...

The star graph S_n of order n, sometimes simply known as an "n-star" (Harary 1994, pp. 17-18; Pemmaraju and Skiena 2003, p. 248; Tutte 2005, p. 23), is a tree on n nodes with ...

A tiling of regular polygons (in two dimensions), polyhedra (three dimensions), or polytopes (n dimensions) is called a tessellation. Tessellations can be specified using a ...

Consider any star of n line segments through one point in space such that no three lines are coplanar. Then there exists a polyhedron, known as a zonohedron, whose faces ...

An alternating knot is a knot which possesses a knot diagram in which crossings alternate between under- and overpasses. Not all knot diagrams of alternating knots need be ...

The word "base" in mathematics is used to refer to a particular mathematical object that is used as a building block. The most common uses are the related concepts of the ...