Search Results for ""

The Riemann-Siegel formula is a formula discovered (but not published) by Riemann for computing an asymptotic formula for the Riemann-Siegel function theta(t). The formula ...

A point at which two noncrossing branches of a curve meet with different tangents.

The probability that a statistical test will be positive for a true statistic.

The sinc function sinc(x), also called the "sampling function," is a function that arises frequently in signal processing and the theory of Fourier transforms. The full name ...

Stirling's approximation gives an approximate value for the factorial function n! or the gamma function Gamma(n) for n>>1. The approximation can most simply be derived for n ...

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 ...

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 ...

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 uniform polyhedra are polyhedra consisting of regular (possibly polygrammic) faces of equal edge length whose polyhedron vertices are all symmetrically equivalent. The ...

The chromatic number of a graph G is the smallest number of colors needed to color the vertices of G so that no two adjacent vertices share the same color (Skiena 1990, p. ...