Search Results for ""
841 - 850 of 2376 for onnected Dominating SetSearch Results
A linear system of equations is a set of n linear equations in k variables (sometimes called "unknowns"). Linear systems can be represented in matrix form as the matrix ...
Mergelyan's theorem can be stated as follows (Krantz 1999). Let K subset= C be compact and suppose C^*\K has only finitely many connected components. If f in C(K) is ...
Let X be a locally convex topological vector space and let K be a compact subset of X. In functional analysis, Milman's theorem is a result which says that if the closed ...
Let T be a linear operator on a separable Hilbert space. The spectrum sigma(T) of T is the set of lambda such that (T-lambdaI) is not invertible on all of the Hilbert space, ...
If f:D->Y is a map (a.k.a. function, transformation, etc.) over a domain D, then the range of f, also called the image of D under f, is defined as the set of all values that ...
In nonstandard analysis, the limitation to first-order analysis can be avoided by using a construction known as a superstructure. Superstructures are constructed in the ...
The transitive closure of a binary relation R on a set X is the minimal transitive relation R^' on X that contains R. Thus aR^'b for any elements a and b of X provided that ...
If S is any nonempty partially ordered set in which every chain has an upper bound, then S has a maximal element. This statement is equivalent to the axiom of choice. Renteln ...
A plane-filling arrangement of plane figures or its generalization to higher dimensions. Formally, a tiling is a collection of disjoint open sets, the closures of which cover ...
Topology is the mathematical study of the properties that are preserved through deformations, twistings, and stretchings of objects. Tearing, however, is not allowed. A ...
...
View search results from all Wolfram sites (33238 matches)

