Search Results for ""

Sample size is the number of observations in a sample (Evans et al. 2000, p. 16). It is commonly denoted n or N.

A correspondence between a permutation and a pair of Young tableaux.

A planar graph corresponding to polyhedra skeletons. The polyhedral graphs are special cases.

Let R+B be the number of monochromatic forced triangles (where R and B are the number of red and blue triangles) in an extremal graph. Then R+B=(n; 3)-|_1/2n|_1/4(n-1)^2_|_|, ...

In random number computation, a seed is an initial number used as the starting point in a random number generating algorithm. In a dynamical system, a seed is a starting ...

A graph G is said to be separable if it is either disconnected or can be disconnected by removing one vertex, called articulation. A graph that is not separable is said to be ...

An graph edge of a graph is separating if a path from a point A to a point B must pass over it. Separating graph edges can therefore be viewed as either bridges or dead ends.

One of the disjoint subsets making up a set partition. A block containing n elements is called an n-block. The partitioning of sets into blocks can be denoted using a ...

A set partition of a set S is a collection of disjoint subsets of S whose union is S. The number of partitions of the set {k}_(k=1)^n is called a Bell number.

A sorting method proposed by Shell (1959) in which records being sorted can take long jumps instead of being restricted to short steps.