Search Results for ""

A graceful graph is a graph that can be gracefully labeled. Special cases of graceful graphs include the utility graph K_(2,3) (Gardner 1983) and Petersen graph. A graph that ...

Guy's "strong law of small numbers" states that there aren't enough small numbers to meet the many demands made of them. Guy (1988) also gives several interesting and ...

An n-mark Golomb ruler is a set of n distinct nonnegative integers (a_1,a_2,...,a_n), called "marks," such that the positive differences |a_i-a_j|, computed over all possible ...

A quadratic equation is a second-order polynomial equation in a single variable x ax^2+bx+c=0, (1) with a!=0. Because it is a second-order polynomial equation, the ...

A regular continued fraction is a simple continued fraction x = b_0+1/(b_1+1/(b_2+1/(b_3+...))) (1) = K_(k=1)^(infty)1/(b_k) (2) = [b_0;b_1,b_2,...], (3) where b_0 is an ...

An addition chain for a number n is a sequence 1=a_0<a_1<...<a_r=n, such that each member after a_0 is the sum of two earlier (not necessarily distinct) ones. The number r is ...

If f(z) is meromorphic in a region R enclosed by a contour gamma, let N be the number of complex roots of f(z) in gamma, and P be the number of poles in gamma, with each zero ...

The average disorder number of a simple connected graph on n vertices is defined as the average length of a walk along the edges of the graph taken over all ordering of its ...

A number n is called a barrier of a number-theoretic function f(m) if, for all m<n, m+f(m)<=n. Neither the totient function phi(n) nor the divisor function sigma(n) has a ...

The problem of finding the number of different ways in which a product of n different ordered factors can be calculated by pairs (i.e., the number of binary bracketings of n ...