Search Results for ""

A sequence defined from a finite sequence a_0, a_1, ..., a_n by defining a_(n+1)=mex_(i)(a_i+a_(n-i)), where mex is the mex (minimum excluded value).

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

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

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

The rook is a chess piece that may move any number of spaces either horizontally or vertically per move. The maximum number of nonattacking rooks that may be placed on an n×n ...

For a subgroup H of a group G, the index of H, denoted (G:H), is the cardinal number of the set of left cosets of H in G (which is equal to the cardinal number of the set of ...

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

A metatheorem stating that every theorem on partially ordered sets remains true if all inequalities are reversed. In this operation, supremum must be replaced by infimum, ...

A vertex cut, also called a vertex cut set or separating set (West 2000, p. 148), of a connected graph G is a subset of the vertex set S subset= V(G) such that G-S has more ...

A triangle ABC formed by three circular arcs. By extending the arcs into complete circles, the points of intersection A^', B^', and C^' are obtained. This gives the three ...