Search Results for ""

A minimal vertex cut is an vertex cut of a graph that is not a proper subset of any other vertex cut. Every minimum vertex cut is a minimal vertex cut, but the converse does ...

The (lower) domination number gamma(G) of a graph G is the minimum size of a dominating set of vertices in G, i.e., the size of a minimum dominating set. This is equivalent ...

Suppose f(x) is a function of x that is twice differentiable at a stationary point x_0. 1. If f^('')(x_0)>0, then f has a local minimum at x_0. 2. If f^('')(x_0)<0, then f ...

How can n points be distributed on a unit sphere such that they maximize the minimum distance between any pair of points? This maximum distance is called the covering radius, ...

A vertex coloring is an assignment of labels or colors to each vertex of a graph such that no edge connects two identically colored vertices. The most common type of vertex ...

Specifying two adjacent angles A and B and the side between them c uniquely (up to geometric congruence) determines a triangle with area K=(c^2)/(2(cotA+cotB)). (1) The angle ...

A theorem from information theory that is a simple consequence of the weak law of large numbers. It states that if a set of values X_1, X_2, ..., X_n is drawn independently ...

The "natural exponential function" is the name sometimes given in elementary contexts to the function f(x)=e^x, where e =2.718... is the base of the natural logarithm. While ...

The lower independence number i(G) of a graph G is the minimum size of a maximal independent vertex set in G. The lower indepedence number is equiavlent to the "independent ...

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