Search Results for ""

The function defined by y=ab^(q^x). It is used in actuarial science for specifying a simplified mortality law (Kenney and Keeping 1962, p. 241). Using s(x) as the probability ...

Given a hereditary representation of a number n in base b, let B[b](n) be the nonnegative integer which results if we syntactically replace each b by b+1 (i.e., B[b] is a ...

Two distinct knots cannot have the same exterior. Or, equivalently, a knot is completely determined by its knot exterior (Cipra 1988; Adams 1994, p. 261). The question was ...

A general quartic surface defined by x^4+y^4+z^4+a(x^2+y^2+z^2)^2+b(x^2+y^2+z^2)+c=0 (1) (Gray 1997, p. 314). The above two images correspond to (a,b,c)=(0,0,-1), and ...

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

The term "gradient" has several meanings in mathematics. The simplest is as a synonym for slope. The more general gradient, called simply "the" gradient in vector analysis, ...

The coarseness xi(G) of a graph G is the maximum number of edge-disjoint nonplanar subgraphs contained in a given graph G. The coarseness of a planar graph G is therefore ...

Let S be a set and F={S_1,...,S_p} a nonempty family of distinct nonempty subsets of S whose union is union _(i=1)^pS_i=S. The intersection graph of F is denoted Omega(F) and ...

There exists no known P algorithm for graph isomorphism testing, although the problem has also not been shown to be NP-complete. In fact, the problem of identifying ...

The skewness of a graph G is the minimum number of edges whose removal results in a planar graph (Harary 1994, p. 124). The skewness is sometimes denoted mu(G) (Cimikowski ...