Search Results for ""

The Georges graph, illustrated above, is 50-node graph which is the smallest currently known example of a 3-connected bicubic nonhamiltonian graph. It is implemented in the ...

A real-valued univariate function f=f(x) is said to have an infinite discontinuity at a point x_0 in its domain provided that either (or both) of the lower or upper limits of ...

The Lambert azimuthal equal-area projection is a map projection having transformation equations x = k^'cosphisin(lambda-lambda_0) (1) y = ...

The Morgan-Voyce polynomials are polynomials related to the Brahmagupta and Fibonacci polynomials. They are defined by the recurrence relations b_n(x) = ...

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

A geodesic on a paraboloid x = sqrt(u)cosv (1) y = sqrt(u)sinv (2) z = u (3) has differential parameters defined by P = ...

The party problem, also known as the maximum clique problem, asks to find the minimum number of guests that must be invited so that at least m will know each other or at ...

Let Y^X be the set of continuous mappings f:X->Y. Then the topological space Y^X supplied with the compact-open topology is called a mapping space. If (Y,*) is a pointed ...

Let f(x) be integrable in [-1,1], let (1-x^2)f(x) be of bounded variation in [-1,1], let M^' denote the least upper bound of |f(x)(1-x^2)| in [-1,1], and let V^' denote the ...

The Poisson-Charlier polynomials c_k(x;a) form a Sheffer sequence with g(t) = e^(a(e^t-1)) (1) f(t) = a(e^t-1), (2) giving the generating function ...