Search Results for ""

There are two distinct notions of connectivity in a directed graph. A directed graph is weakly connected if there is an undirected path between any pair of vertices, and ...

The Conway polynomial del _L(x), sometimes known as the Conway-Alexander polynomial, is a modified version of the Alexander polynomial Delta_L(x) that was formulated by J. H. ...

The categorical notion which is dual to product. The coproduct of a family {X_i}_(i in I) of objects of a category is an object C=coproduct_(i in I)X_i, together with a ...

A recursively enumerable set A is creative if its complement is productive. Creative sets are not recursive. The property of creativeness coincides with completeness. Namely, ...

The cross number of a zero-system sigma={g_1,g_2,...,g_n} of G is defined as K(sigma)=sum_(i=1)^n1/(|g_i|) The cross number of a group G has two different definitions. 1. ...

The symbol union , used for the union of sets, and, sometimes, also for the logical connective OR instead of the symbol v (vee). In fact, for any two sets A and B x in A ...

A cusp form is a modular form for which the coefficient c(0)=0 in the Fourier series f(tau)=sum_(n=0)^inftyc(n)e^(2piintau) (1) (Apostol 1997, p. 114). The only entire cusp ...

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

C_3 is the unique group of group order 3. It is both Abelian and cyclic. Examples include the point groups C_3, C_(3v), and C_(3h) and the integers under addition modulo 3 ...