Search Results for ""

The plots above show the values of the function obtained by taking the natural logarithm of the gamma function, lnGamma(z). Note that this introduces complicated branch cut ...

The vertex connectivity kappa(G) of a graph G, also called "point connectivity" or simply "connectivity," is the minimum size of a vertex cut, i.e., a vertex subset S subset= ...

The edge connectivity, also called the line connectivity, of a graph is the minimum number of edges lambda(G) whose deletion from a graph G disconnects G. In other words, it ...

The mathematical study of knots. Knot theory considers questions such as the following: 1. Given a tangled loop of string, is it really knotted or can it, with enough ...

The spherical distance between two points P and Q on a sphere is the distance of the shortest path along the surface of the sphere (paths that cut through the interior of the ...

A sliver of the surface of a sphere of radius r cut out by two planes through the azimuthal axis with dihedral angle theta. The surface area of the lune is S=2r^2theta, which ...

Definitions about a set which depend on the entire set.

Proportionally cutting circles are circles that intersect the sidelines of a reference triangle DeltaABC such that length of the chords that are cut off have lengths mua, ...

A set considered together with the sigma-algebra on the set.

A cylindrical wedge, also called a cylindrical hoof or cylindrical ungula, is a wedge cut from a cylinder by slicing with a plane that intersects the base of the cylinder. ...