Search Results for ""

The Heesch number of a closed plane figure is the maximum number of times that figure can be completely surrounded by copies of itself. The determination of the maximum ...

The hexagram is the star polygon {6/2}, also known as the star of David or Solomon's seal, illustrated at left above. It appears as one of the clues in the novel The Da Vinci ...

For a real number x in (0,1), let m be the number of terms in the convergent to a regular continued fraction that are required to represent n decimal places of x. Then Lochs' ...

A simple continued fraction is a special case of a generalized continued fraction for which the partial numerators are equal to unity, i.e., a_n=1 for all n=1, 2, .... A ...

Linear programming, sometimes known as linear optimization, is the problem of maximizing or minimizing a linear function over a convex polyhedron specified by linear and ...

A quartic symmetric graph is a symmetric graph that is also quartic (i.e., regular of degree 4). The numbers of symmetric quartic graphs on n=1, 2, ... are 0, 0, 0, 0, 1, 1, ...

A fullerene is a cubic polyhedral graph having all faces 5- or 6-cycles. Examples include the 20-vertex dodecahedral graph, 24-vertex generalized Petersen graph GP(12,2), ...

A Haar graph H(n) is a bipartite regular indexed by a positive integer and obtained by a simple binary encoding of cyclically adjacent vertices. Haar graphs may be connected ...

The term "square" can be used to mean either a square number ("x^2 is the square of x") or a geometric figure consisting of a convex quadrilateral with sides of equal length ...

A (v,g)-cage graph is a v-regular graph of girth g having the minimum possible number of nodes. When v is not explicitly stated, the term "g-cage" generally refers to a ...