TOPICS
Search

Search Results for ""


21 - 30 of 2400 for Dense SetSearch Results
A (symmetrical) boundary set of radius r and center x_0 is the set of all points x such that |x-x_0|=r. Let x_0 be the origin. In R^1, the boundary set is then the pair of ...
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 set partition of a set S is a collection of disjoint subsets of S whose union is S. The number of partitions of the set {k}_(k=1)^n is called a Bell number.
A set having exactly one element a. A singleton set is denoted by {a} and is the simplest example of a nonempty set.
A set S with a single point P removed is called a punctured set, written S\{P}.
Let S be a subset of a metric space. Then the set S is open if every point in S has a neighborhood lying in the set. An open set of radius r and center x_0 is the set of all ...
The Mandelbar set is a fractal set analogous to the Mandelbrot set or its generalization to a higher power with the variable z replaced by its complex conjugate z^_.
A degree set is a set of integers that make up a degree sequence. Any set of positive integers is the degree set for some graph, because any odd integer from that set can be ...
A Julia set J consisting of a set of isolated points which is formed by taking a point outside an underlying set M (e.g., the Mandelbrot set). If the point is outside but ...
The concept of irredundance was introduced by Cockayne et al. (1978). Let N_G[v] denote the graph neighborhood of a vertex v in a graph G (including v itself), and let N_G[S] ...
1|2|3|4|5|6 ... 240 Previous Next

...