Search Results for ""

If G^' is a subgraph of G, then G is said to be a supergraph of G^'.

Trials for which the Lexis ratio L=sigma/(sigma_B), satisfies L>1, where sigma is the variance in a set of s Lexis trials and sigma_B is the variance assuming Bernoulli ...

A symmetric design is a block design (v, k, lambda, r, b) with the same number of blocks as points, so b=v (or, equivalently, r=k). An example of a symmetric block design is ...

The order n T-polyomino consists of a vertical line of n-3 squares capped by a horizontal line of three squares centered on the line.

A 3-coloring of graph edges so that no two edges of the same color meet at a graph vertex (Ball and Coxeter 1987, pp. 265-266).

A set of circuits going along the graph edges of a graph, each with an even number of graph edges, such that just one of the circuits passes through each graph vertex (Ball ...

An (n,k)-talisman hexagon is an arrangement of nested hexagons containing the integers 1, 2, ..., H_n=3n(n-1)+1, where H_n is the nth hex number, such that the difference ...

An n×n array of the integers from 1 to n^2 such that the difference between any one integer and its neighbor (horizontally, vertically, or diagonally, without wrapping ...

2^(40)=1024^4=1099511627776 bytes. Although the term terabyte is sometimes used to refer to 1024^4 bytes, such usage is deprecated in favor of the standard SI naming ...

An ordered finite configuration with certain pairs of points, called cables, which are constrained not to get further apart and certain other pairs of points, called struts, ...