Search Results for ""

Given a weighted, undirected graph G=(V,E) and a graphical partition of V into two sets A and B, the cut of G with respect to A and B is defined as cut(A,B)=sum_(i in A,j in ...

The cut elimination theorem, also called the "Hauptsatz" (Gentzen 1969), states that every sequent calculus derivation can be transformed into another derivation with the ...

A chord of a graph cycle C is an edge not in the edge set of C whose endpoints lie in the vertex set C (West 2000, p. 225). For example, in the diamond graph as labeled ...

The n-cycle complement graph C^__n is the graph complement of the cycle graph C_n. Cycle complement graphs are special cases of circulant graphs. The first few are ...

The cycle double cover conjecture states that every bridgeless graph has a collection of cycles which together contain every edge exactly twice. This conjecture remains open, ...

A cyclic graph is a graph containing at least one graph cycle. A graph that is not cyclic is said to be acyclic. A cyclic graph possessing exactly one (undirected, simple) ...

A hexagon (not necessarily regular) on whose polygon vertices a circle may be circumscribed. Let sigma_i=Pi_i(a_1^2,a_2^2,a_3^2,a_4^2,a_5^2,a_6^2) (1) denote the ith-order ...

A bounded linear operator T in B(H) on a Hilbert space H is said to be cyclic if there exists some vector v in H for which the set of orbits ...

A cyclic pentagon is a not necessarily regular pentagon on whose polygon vertices a circle may be circumscribed. Let such a pentagon have edge lengths a_1, ..., a_5, and area ...

A cyclic polygon is a polygon with vertices upon which a circle can be circumscribed. Since every triangle has a circumcircle, every triangle is cyclic. It is conjectured ...