Search Results for ""

A problem asking for the shortest tour of a graph which visits each edge at least once (Kwan 1962; Skiena 1990, p. 194). For an Eulerian graph, an Eulerian cycle is the ...

The clique covering number theta(G) of a graph G is the minimum number of cliques in G needed to cover the vertex set of G. Since theta(G) involves the minimum number of ...

A linear operator A:D(A)->H from its domain D(A) into a Hilbert space H is closable if it has a closed extension B:D(B)->H where D(A) subset D(B). Closable operators are ...

A coequalizer of a pair of maps f,g:X->Y in a category is a map c:Y->C such that 1. c degreesf=c degreesg, where degrees denotes composition. 2. For any other map c^':Y->C^' ...

The commutator subgroup (also called a derived group) of a group G is the subgroup generated by the commutators of its elements, and is commonly denoted G^' or [G,G]. It is ...

Let K subset V subset S^3 be a knot that is geometrically essential in a standard embedding of the solid torus V in the three-sphere S^3. Let K_1 subset S^3 be another knot ...

Suppose <= is a partial ordering on a nonempty set A. Then the elements a,b in A are said to be comparable provided a<=b or b<=a. Because two elements in a partially ordered ...

A completely multiplicative function, sometimes known as linear or totally multiplicative function, is an arithmetic function f(n) such that f(mn)=f(m)f(n) holds for each ...

A measure which takes values in the complex numbers. The set of complex measures on a measure space X forms a vector space. Note that this is not the case for the more common ...

A composite knot is a knot that is not a prime knot. Schubert (1949) showed that every knot can be uniquely decomposed (up to the order in which the decomposition is ...