Search Results for ""

The amazing polynomial identity communicated by Euler in a letter to Goldbach on April 12, 1749 (incorrectly given as April 15, 1705--before Euler was born--in Conway and Guy ...

The size of a minimum edge cover in a graph G is known as the edge cover number of G, denoted rho(G). If a graph G has no isolated points, then nu(G)+rho(G)=|G|, where nu(G) ...

A polyhedral graph on five nodes. There are two topologically distinct pentahedral graphs which, through duality, correspond to the skeletons of the square pyramid (left ...

Computational number theory is the branch of number theory concerned with finding and implementing efficient computer algorithms for solving various problems in number ...

An order-n Costas array is a permutation on {1,...,n} such that the distances in each row of the triangular difference table are distinct. For example, the permutation ...

A number n for which the product of divisors is equal to n^2. The first few are 1, 6, 8, 10, 14, 15, 21, 22, ... (OEIS A007422).

A sum-product number is a number n such that the sum of n's digits times the product of n's digit is n itself, for example 135=(1+3+5)(1·3·5). (1) Obviously, such a number ...

The edge chromatic number, sometimes also called the chromatic index, of a graph G is fewest number of colors necessary to color each edge of G such that no two edges ...

A Sierpiński number of the first kind is a number of the form S_n=n^n+1. The first few are 2, 5, 28, 257, 3126, 46657, 823544, 16777217, ... (OEIS A014566). Sierpiński proved ...

The lower independence number i(G) of a graph G is the minimum size of a maximal independent vertex set in G. The lower indepedence number is equiavlent to the "independent ...