Search Results for ""

There are two definitions of a metacyclic group. 1. A metacyclic group is a group G such that both its commutator subgroup G^' and the quotient group G/G^' are cyclic (Rose ...

The minimum spanning tree of a weighted graph is a set of edges of minimum total weight which form a spanning tree of the graph. When a graph is unweighted, any spanning tree ...

A minimum vertex cover is a vertex cover having the smallest possible number of vertices for a given graph. The size of a minimum vertex cover of a graph G is known as the ...

A module is a mathematical object in which things can be added together commutatively by multiplying coefficients and in which most of the rules of manipulating vectors hold. ...

A monomial is a product of positive integer powers of a fixed set of variables (possibly) together with a coefficient, e.g., x, 3xy^2, or -2x^2y^3z. A monomial can also be ...

Multiple edges are two or more edges connecting the same two vertices within a multigraph. Multiple edges of degree d_(ij) between vertex i and vertex j correspond to an ...

An error which is superimposed on top of a true signal. Noise may be random or systematic. Noise can be greatly reduced by transmitting signals digitally instead of in analog ...

A nonnegative matrix is a real or integer matrix (a)_(ij) for which each matrix element is a nonnegative number, i.e., a_(ij)>=0 for all i, j. Nonnegative matrices are ...

A connective in logic which yields true if any one of a sequence conditions is true, and false if all conditions are false. In formal logic, the term disjunction (or, more ...

Every totally ordered set (A,<=) is associated with a so-called order type. Two sets A and B are said to have the same order type iff they are order isomorphic (Ciesielski ...