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

Two points which are collinear with respect to a similitude center but are not homologous points. Four interesting theorems from Johnson (1929) follow. 1. Two pairs of ...

The 13 Archimedean solids are the convex polyhedra that have a similar arrangement of nonintersecting regular convex polygons of two or more different types arranged in the ...

The BBP (named after Bailey-Borwein-Plouffe) is a formula for calculating pi discovered by Simon Plouffe in 1995, ...

Krall and Fink (1949) defined the Bessel polynomials as the function y_n(x) = sum_(k=0)^(n)((n+k)!)/((n-k)!k!)(x/2)^k (1) = sqrt(2/(pix))e^(1/x)K_(-n-1/2)(1/x), (2) where ...

A coordinate system which is similar to bispherical coordinates but having fourth-degree surfaces instead of second-degree surfaces for constant mu. The coordinates are given ...

A Bill picture is a sequence of nested regular polygons in which subsequent polygons are each rotated so that they begin one vertex further. The term was coined by Trott ...

A Boolean algebra is a mathematical structure that is similar to a Boolean ring, but that is defined using the meet and join operators instead of the usual addition and ...

Branch and bound algorithms are a variety of adaptive partition strategies have been proposed to solve global optimization models. These are based upon partition, sampling, ...

Given triangle DeltaA_1A_2A_3, let the point of intersection of A_2Omega and A_3Omega^' be B_1, where Omega and Omega^' are the Brocard points, and similarly define B_2 and ...