Search Results for ""

A Hamiltonian walk on a connected graph is a closed walk of minimal length which visits every vertex of a graph (and may visit vertices and edges multiple times). For ...

In cylindrical coordinates, the scale factors are h_r=1, h_theta=r, h_z=1, so the Laplacian is given by del ...

Using the notation of Byerly (1959, pp. 252-253), Laplace's equation can be reduced to (1) where alpha = cint_c^lambda(dlambda)/(sqrt((lambda^2-b^2)(lambda^2-c^2))) (2) = ...

In spherical coordinates, the scale factors are h_r=1, h_theta=rsinphi, h_phi=r, and the separation functions are f_1(r)=r^2, f_2(theta)=1, f_3(phi)=sinphi, giving a Stäckel ...

There are several types of numbers that are commonly termed "lucky numbers." The first is the lucky numbers of Euler. The second is obtained by writing out all odd numbers: ...

A system of curvilinear coordinates in which two sets of coordinate surfaces are obtained by revolving the curves of the elliptic cylindrical coordinates about the y-axis ...

A quintic nonhamiltonian graph is a quintic graph that is nonhamiltonian. A number of such graphs are illustrated above. Owens (1980) showed that there exists a ...

The truncated great dodecahedron is the uniform polyhedron with Maeder index 37 (Maeder 1997), Wenninger index 75 (Wenninger 1989), Coxeter index 47 (Coxeter et al. 1954), ...

The value for zeta(2)=sum_(k=1)^infty1/(k^2) (1) can be found using a number of different techniques (Apostol 1983, Choe 1987, Giesy 1972, Holme 1970, Kimble 1987, Knopp and ...

The improvement of the convergence properties of a series, also called convergence acceleration or accelerated convergence, such that a series reaches its limit to within ...