Search Results for ""

A theorem which effectively describes how lengths, areas, volumes, and generalized n-dimensional volumes (contents) are distorted by differentiable functions. In particular, ...

A class of formal series expansions in derivatives of a distribution Psi(t) which may (but need not) be the normal distribution function Phi(t)=1/(sqrt(2pi))e^(-t^2/2) (1) ...

Form a sequence from an alphabet of letters [1,n] such that there are no consecutive letters and no alternating subsequences of length greater than d. Then the sequence is a ...

A convex polyomino containing at least one edge of its minimal bounding rectangle. The perimeter and area generating function for directed polygons of width m, height n, and ...

For a graph G and a subset S of the vertex set V(G), denote by N_G[S] the set of vertices in G which are in S or adjacent to a vertex in S. If N_G[S]=V(G), then S is said to ...

A double-toroidal graph is a graph with graph genus 2 (West 2000, p. 266). Planar and toroidal graphs are therefore not double-toroidal. Some known double-toroidal graphs on ...

A (p,q)-graph is edge-graceful if the edges can be labeled 1 through q in such a way that the labels induced on the vertices by summing over incident edges modulo p are ...

The term "Euler graph" is sometimes used to denote a graph for which all vertices are of even degree (e.g., Seshu and Reed 1961). Note that this definition is different from ...

The exponent is the component of a finite floating-point representation that signifies the integer power to which the radix is raised in determining the value of that ...

The graph strong product, also known as the graph AND product or graph normal product, is a graph product variously denoted G□AdjustmentBox[x, BoxMargins -> {{-0.65, ...