Search Results for ""

A generalized Moore graph is a regular graph of degree r where the counts of vertices at each distance d=0, 1, ... from any vertex are 1, r, r(r-1), r(r-1)^2, r(r-1)^3, ..., ...

The continued fraction of A is [1; 3, 1, 1, 5, 1, 1, 1, 3, 12, 4, 1, 271, 1, ...] (OEIS A087501). A plot of the first 256 terms of the continued fraction represented as a ...

An imperfect graph G is a graph that is not perfect. Therefore, graphs G with omega(G)<chi(G) (1) where omega(G) is the clique number and chi(G) is the chromatic number are ...

The maximum leaf number l(G) of a graph G is the largest number of tree leaves in any of its spanning trees. (The corresponding smallest number of leaves is known as the ...

A merge sort (or collation sort) is the combination of two or more ordered lists into a single ordered list (Knuth 1998, p. 158). Merge sorting was one of the first methods ...

A monomial is a product of positive integer powers of a fixed set of variables (possibly) together with a coefficient, e.g., x, 3xy^2, or -2x^2y^3z. A monomial can also be ...

A phi-prime is a prime number appearing in the decimal expansion of the golden ratio phi. The first few are 1618033, 1618033988749, ... (OEIS A064117). The numbers of decimal ...

Schur's partition theorem lets A(n) denote the number of partitions of n into parts congruent to +/-1 (mod 6), B(n) denote the number of partitions of n into distinct parts ...

A number (usually base 10 unless specified otherwise) which has no digitaddition generator. Such numbers were originally called Colombian numbers (S. 1974). There are ...

A median A_1M_1 of a triangle DeltaA_1A_2A_3 is the Cevian from one of its vertices A_1 to the midpoint M_1 of the opposite side. The three medians of any triangle are ...