Search Results for ""

A minimal edge cover is an edge cover of a graph that is not a proper subset of any other edge cover. Every minimum edge cover is a minimal edge cover, but the converse does ...

A minimal vertex cut is an vertex cut of a graph that is not a proper subset of any other vertex cut. Every minimum vertex cut is a minimal vertex cut, but the converse does ...

A negative matrix is a real or integer matrix (a)_(ij) for which each matrix element is a negative number, i.e., a_(ij)<0 for all i, j. Negative matrices are therefore a ...

An outcome is a subset of a probability space. Experimental outcomes are not uniquely determined from the description of an experiment, and must be agreed upon to avoid ...

Let D be a subset of the nonnegative integers Z^* with the properties that (1) the integer 0 is in D and (2) any time that the interval [0,n] is contained in D, one can show ...

If a subset S of the elements of a field F satisfies the field axioms with the same operations of F, then S is called a subfield of F. In a finite field of field order p^n, ...

If f is a function on an open set U, then the zero set of f is the set Z={z in U:f(z)=0}. A subset of a topological space X is called a zero set if it is equal to f^(-1)(0) ...

A double sum is a series having terms depending on two indices, sum_(i,j)b_(ij). (1) A finite double series can be written as a product of series ...

Let a convex cyclic polygon be triangulated in any manner, and draw the incircle to each triangle so constructed. Then the sum of the inradii is a constant independent of the ...

An independent vertex set of a graph G is a subset of the vertices such that no two vertices in the subset represent an edge of G. The figure above shows independent sets ...