Search Results for ""

The Euclidean algorithm, also called Euclid's algorithm, is an algorithm for finding the greatest common divisor of two numbers a and b. The algorithm can also be defined for ...

A graceful labeling (or graceful numbering) is a special graph labeling of a graph on m edges in which the nodes are labeled with a subset of distinct nonnegative integers ...

As proposed by Hosoya (1971), the Hosoya index (also called Z-index) of a graph is defined by Z = sum_(k=0)^(n)|a_k| (1) = sum_(k=0)^(n)b_k, (2) where n is the number of ...

The hundred-dollar, hundred-digits challenge problems are a set of ten problems in numerical analysis published in the January/February 2002 issue of SIAM News ...

In his last letter to Hardy, Ramanujan defined 17 Jacobi theta function-like functions F(q) with |q|<1 which he called "mock theta functions" (Watson 1936ab, Ramanujan 1988, ...

A regular polygon is an n-sided polygon in which the sides are all the same length and are symmetrically placed about a common center (i.e., the polygon is both equiangular ...

A simple graph, also called a strict graph (Tutte 1998, p. 2), is an unweighted, undirected graph containing no graph loops or multiple edges (Gibbons 1985, p. 2; West 2000, ...

Let G be an undirected graph, and let i denote the cardinal number of the set of externally active edges of a spanning tree T of G, j denote the cardinal number of the set of ...

The Bernoulli numbers B_n are a sequence of signed rational numbers that can be defined by the exponential generating function x/(e^x-1)=sum_(n=0)^infty(B_nx^n)/(n!). (1) ...

A polynomial given by Phi_n(x)=product_(k=1)^n^'(x-zeta_k), (1) where zeta_k are the roots of unity in C given by zeta_k=e^(2piik/n) (2) and k runs over integers relatively ...