Search Results for ""

A minimum edge cover is an edge cover having the smallest possible number of edges for a given graph. The size of a minimum edge cover of a graph is known as the edge cover ...

Bubbles can meet only at angles of 120 degrees (for three bubbles) and cos^(-1)(-1/3) approx 109 degrees28^'16^('') (for four bubbles), where cos^(-1)(-1/3) is the ...

An orientable surface with one boundary component such that the boundary component of the surface is a given knot K. In 1934, Seifert proved that such a surface can be ...

Define the minimal bounding rectangle as the smallest rectangle containing a given lattice polygon. If the perimeter of the lattice polygon is equal to that of its minimal ...

The conjugate gradient method is an algorithm for finding the nearest local minimum of a function of n variables which presupposes that the gradient of the function can be ...

A unit-distance graph is a distance graph having an embedding in the Euclidean plane (unit-distance embedding) in which vertices are distinct points and all edges are of ...

A branch of mathematics that is a sort of generalization of calculus. Calculus of variations seeks to find the path, curve, surface, etc., for which a given function has a ...

A geodesic is a locally length-minimizing curve. Equivalently, it is a path that a particle which is not accelerating would follow. In the plane, the geodesics are straight ...

The hyperbolic cosine is defined as coshz=1/2(e^z+e^(-z)). (1) The notation chx is sometimes also used (Gradshteyn and Ryzhik 2000, p. xxix). This function describes the ...

The hyperbolic sine is defined as sinhz=1/2(e^z-e^(-z)). (1) The notation shz is sometimes also used (Gradshteyn and Ryzhik 2000, p. xxix). It is implemented in the Wolfram ...