Search Results for ""

A cubic polyhedral graph is a graph that is both cubic and polyhedral. The numbers of cubical polyhedral graphs on n=2, 4, ... nodes are 0, 1, 1, 2, 5, 14, 50, 233, 1249, ... ...

A phrase used by Tukey to describe data points which are outside the outer fences.

Values one step outside the hinges are called inner fences, and values two steps outside the hinges are called outer fences. Tukey calls values outside the outer fences far ...

The difference H_2-H_1, where H_1 and H_2 are hinges. It is the same as the interquartile range for N=5, 9, 13, ... points.

The term "ice fractal" refers to a fractal (square, triangle, etc.) that is based on a simple generating motif. The above plots show the ice triangle, antitriangle, square, ...

Any prime number other than 2 (which is the unique even prime). Humorously, 2 is therefore the "oddest" prime.

1.5 times the H-spread.

Tait's Hamiltonian graph conjecture asserted that every cubic polyhedral graph is Hamiltonian. It was proposed by Tait in 1880 and refuted by Tutte (1946) with a ...

The Gauss map is a function N from an oriented surface M in Euclidean space R^3 to the unit sphere in R^3. It associates to every point on the surface its oriented unit ...

The number of partitions of n in which no parts are multiples of k is sometimes denoted b_k(n) (Gordon and Ono 1997). b_k(n) is also the number of partitions of n into at ...