Search Results for ""

A 1-factor of a graph G with n graph vertices is a set of n/2 separate graph edges which collectively contain all n of the graph vertices of G among their endpoints.

A loop of an graph is degenerate edge that joins a vertex to itself, also called a self-loop. A simple graph cannot contain any loops, but a pseudograph can contain both ...

Consider a clause (disjunction of literals) obtained from those of a first-order logic formula Phi in Skolemized form forall x_1... forall x_nS. Then an atomic statement ...

Consider a clause (disjunction of literals) obtained from those of a first-order logic sentential formula Phi in Skolemized form forall x_1... forall x_nS, then a clause ...

Consider a clause (disjunction of literals) obtained from those of a first-order logic formula Phi in Skolemized form forall x_1... forall x_nS. Then a literal obtained from ...

The kernel of a group homomorphism f:G-->G^' is the set of all elements of G which are mapped to the identity element of G^'. The kernel is a normal subgroup of G, and always ...

A one-dimensional transform which makes use of the Haar functions.

A fast Fourier transform-like algorithm which produces a hologram of an image.

There exists a system of distinct representatives for a family of sets S_1, S_2, ..., S_m iff the union of any k of these sets contains at least k elements for all k from 1 ...

The set of all ground atoms that can be formed from predicate symbols from a clause in Skolemized form S and terms from the Herbrand universe H of S.