Search Results for ""

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

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 X whose elements can be numbered through from 1 to n, for some positive integer n. The number n is called the cardinal number of the set, and is often denoted |X| or ...

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 having exactly one element a. A singleton set is denoted by {a} and is the simplest example of a nonempty set.

There are several equivalent definitions of a closed set. Let S be a subset of a metric space. A set S is closed if 1. The complement of S is an open set, 2. S is its own set ...

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 set S with a single point P removed is called a punctured set, written S\{P}.

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] ...

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^_.