Search Results for ""

A maximum irredundant set is an irredundant set of largest possible size in a graph. Note that a maximum irredundant set is not equivalent to a maximal irredundant set, which ...

A class is a generalized set invented to get around Russell's antinomy while retaining the arbitrary criteria for membership which leads to difficulty for sets. The members ...

The level set of a differentiable function f:R^n->R corresponding to a real value c is the set of points {(x_1,...,x_n) in R^n:f(x_1,...,x_n)=c}. For example, the level set ...

Two sets A and B are said to be independent if their intersection A intersection B=emptyset, where emptyset is the empty set. For example, {A,B,C} and {D,E} are independent, ...

A minimum dominating set is a dominating set of smallest size in a given graph. The size of a minimum dominating set is known as the domination number of the graph. A minimum ...

For a graph G and a subset S^t of the vertex set V(G), denote by N_G^t[S^t] the set of vertices in G which are adjacent to a vertex in S^t. If N_G^t[S^t]=V(G), then S^t is ...

An algebraic variety is called irreducible if it cannot be written as the union of nonempty algebraic varieties. For example, the set of solutions to xy=0 is reducible ...

The fractal-like figure obtained by performing the same iteration as for the Mandelbrot set, but adding a random component R, z_(n+1)=z_n^2+c+R. In the above plot, ...

The Cantor set T_infty, sometimes also called the Cantor comb or no middle third set (Cullen 1968, pp. 78-81), is given by taking the interval [0,1] (set T_0), removing the ...

A set S in a metric space (S,d) is bounded if it has a finite generalized diameter, i.e., there is an R<infty such that d(x,y)<=R for all x,y in S. A set in R^n is bounded ...