Search Results for ""

A nonplanar graph is a graph that is not planar. The numbers of simple nonplanar graphs on n=1, 2, ... nodes are 0, 0, 0, 0, 1, 14, 222, 5380, 194815, ... (OEIS A145269), ...

A totalistic cellular automaton is a cellular automata in which the rules depend only on the total (or equivalently, the average) of the values of the cells in a ...

An Eulerian graph is a graph containing an Eulerian cycle. The numbers of Eulerian graphs with n=1, 2, ... nodes are 1, 1, 2, 3, 7, 15, 52, 236, ... (OEIS A133736), the first ...

An ordinary double point of a plane curve is point where a curve intersects itself such that two branches of the curve have distinct tangent lines. Ordinary double points of ...

A quartic graph is a graph which is 4-regular. The unique quartic graph on five nodes is the complete graph K_5, and the unique quartic graph on six nodes is the octahedral ...

A lossless data compression algorithm which uses a small number of bits to encode common characters. Huffman coding approximates the probability for each character as a power ...

A spanning tree of a graph on n vertices is a subset of n-1 edges that form a tree (Skiena 1990, p. 227). For example, the spanning trees of the cycle graph C_4, diamond ...

A grouping of statistics.

Let a module M in an integral domain D_1 for R(sqrt(D)) be expressed using a two-element basis as M=[xi_1,xi_2], where xi_1 and xi_2 are in D_1. Then the different of the ...

A random permutation is a permutation containing a fixed number n of a random selection from a given set of elements. There are two main algorithms for constructing random ...