Search Results for ""

The diamond graph is the simple graph on 4 nodes and 5 edges illustrated above (Brandstädt et al. 1987, p. 18). It is isomorphic to the complete tripartite graph K_(1,1,2) ...

The Dirichlet beta function is defined by the sum beta(x) = sum_(n=0)^(infty)(-1)^n(2n+1)^(-x) (1) = 2^(-x)Phi(-1,x,1/2), (2) where Phi(z,s,a) is the Lerch transcendent. The ...

Given a planar graph G, a geometric dual graph and combinatorial dual graph can be defined. Whitney showed that these are equivalent (Harary 1994), so that one may speak of ...

The falling factorial (x)_n, sometimes also denoted x^(n__) (Graham et al. 1994, p. 48), is defined by (x)_n=x(x-1)...(x-(n-1)) (1) for n>=0. Is also known as the binomial ...

The Gaussian integral, also called the probability integral and closely related to the erf function, is the integral of the one-dimensional Gaussian function over ...

The Gegenbauer polynomials C_n^((lambda))(x) are solutions to the Gegenbauer differential equation for integer n. They are generalizations of the associated Legendre ...

The Glaisher-Kinkelin constant A is defined by lim_(n->infty)(H(n))/(n^(n^2/2+n/2+1/12)e^(-n^2/4))=A (1) (Glaisher 1878, 1894, Voros 1987), where H(n) is the hyperfactorial, ...

Let A(n) denote the number of partitions of n into parts =2,5,11 (mod 12), let B(n) denote the number of partitions of n into distinct parts =2,4,5 (mod 6), and let C(n) ...

Let there be n ways for a "good" selection and m ways for a "bad" selection out of a total of n+m possibilities. Take N samples and let x_i equal 1 if selection i is ...

The inverse cosine is the multivalued function cos^(-1)z (Zwillinger 1995, p. 465), also denoted arccosz (Abramowitz and Stegun 1972, p. 79; Harris and Stocker 1998, p. 307; ...