Search Results for ""

The recurrence relation (n-1)A_(n+1)=(n^2-1)A_n+(n+1)A_(n-1)+4(-1)^n valid for n=4, 5, ... with A(2)=0 and A(3)=1 and which solves the married couples problem (Dörrie 1965, ...

The length is the longest dimension of an object.

A mensuration formula is simply a formula for computing the length-related properties of an object (such as area, circumradius, etc., of a polygon) based on other known ...

A statistical distribution in which the variates occur with probabilities asymptotically matching their "true" underlying statistical distribution is said to be random.

If f is analytic on a domain U, then a point z_0 on the boundary partialU is called regular if f extends to be an analytic function on an open set containing U and also the ...

Let f:D(z_0,r)\{z_0}->C be analytic and bounded on a punctured open disk D(z_0,r), then lim_(z->z_0)f(z) exists, and the function defined by f^~:D(z_0,r)->C f^~(z)={f(z) for ...

There are several definitions of "almost Hamiltonian" in use. As defined by Punnim et al. (2007), an almost Hamiltonian graph is a graph on n nodes having Hamiltonian number ...

A column-convex polyomino is a self-avoiding convex polyomino such that the intersection of any vertical line with the polyomino has at most two connected components. ...

Given an undirected graph, a degree sequence is a monotonic nonincreasing sequence of the vertex degrees (valencies) of its graph vertices. The number of degree sequences for ...

The disdyakis triacontahedral graph is Archimedean dual graph which is the skeleton of the disdyakis triacontahedron. It is implemented in the Wolfram Language as ...