Search Results for ""

A node in a graph for which the graph eccentricity equals the graph diameter (Harary 1994, p. 41).

A graph G is the edge graph of a polyhedron iff G is a simple planar graph which is 3-connected.

The triangle graph is the cycle graph C_3, which is isomorphic to the complete graph K_3 as well as to the complete tripartite graph K_(3×1)=K_(1,1,1) and the triangular ...

The Griewank function is a function widely used to test the convergence of optimization functions. The Griewank function of order n is defined by ...

The Hh-function is a function closely related to the normal distribution function. It can be defined using the auxilary functions Z(x) = 1/(sqrt(2pi))e^(-x^2/2) (1) Q(x) = ...

In his last letter to Hardy, Ramanujan defined 17 Jacobi theta function-like functions F(q) with |q|<1 which he called "mock theta functions" (Watson 1936ab, Ramanujan 1988, ...

A function f(z) is said to be doubly periodic if it has two periods omega_1 and omega_2 whose ratio omega_2/omega_1 is not real. A doubly periodic function that is analytic ...

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

The Dirichlet eta function is the function eta(s) defined by eta(s) = sum_(k=1)^(infty)((-1)^(k-1))/(k^s) (1) = (1-2^(1-s))zeta(s), (2) where zeta(s) is the Riemann zeta ...

If a graph G has n graph vertices such that every pair of the n graph vertices which are not joined by a graph edge has a sum of valences which is >=n, then G is Hamiltonian. ...