Search Results for ""

The smallest possible number of vertices a polyhedral nonhamiltonian graph can have is 11, and there exist 74 such graphs. The Goldner-Harary graph (Goldner and Harary 1975a, ...

k_nu(x)=(e^(-x))/(Gamma(1+1/2nu))U(-1/2nu,0,2x) for x>0, where U is a confluent hypergeometric function of the second kind.

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

There are two definitions of the Carmichael function. One is the reduced totient function (also called the least universal exponent function), defined as the smallest integer ...

The n-double cone graph is the name given in the work to the graphs that geometrically correspond to a double cone obtained by connecting all vertices of two C_n cycle graphs ...

A planar hypotraceable graph is a hypotraceable graph that is also planar. A number of planar hypotraceable graphs are illustrated above. Using a theorem of Thomassen (1974), ...

The Kneser graphs are a class of graph introduced by Lovász (1978) to prove Kneser's conjecture. Given two positive integers n and k, the Kneser graph K(n,k), often denoted ...

A Lyapunov function is a scalar function V(y) defined on a region D that is continuous, positive definite, V(y)>0 for all y!=0), and has continuous first-order partial ...

A function f(x) is said to be periodic (or, when emphasizing the presence of a single period instead of multiple periods, singly periodic) with period p if f(x)=f(x+np) for ...

alpha_n(z) = int_1^inftyt^ne^(-zt)dt (1) = n!z^(-(n+1))e^(-z)sum_(k=0)^(n)(z^k)/(k!). (2) It is equivalent to alpha_n(z)=E_(-n)(z), (3) where E_n(z) is the En-function.