Search Results for ""

The maximum number of disjoint dominating sets in a domatic partition of a graph G is called its domatic number d(G). The domatic number should not be confused with the ...

A maximal independent vertex set of a graph is an independent vertex set that cannot be expanded to another independent vertex set by addition of any vertex in the graph. A ...

The lower independence number i(G) of a graph G is the minimum size of a maximal independent vertex set in G. The lower indepedence number is equiavlent to the "independent ...

The upper domination number Gamma(G) of a graph G is the maximum size of a minimal dominating set of vertices in G. The (lower) domination number may be similarly defined as ...

A member of a collection of sets is said to be maximal if it cannot be expanded to another member by addition of any element. Maximal sets are important in graph theory since ...

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

A semialgebraic set is a subset of R^n which is a finite Boolean combination of sets of the form {x^_=(x_1,...,x_n):f(x^_)>0} and {x^_:g(x^_)=0}, where f and g are ...

A set P is called perfect if P=P^', where P^' is the derived set of P.

Rubik's Clock is a puzzle consisting of 18 small clocks, 14 of which are independent, each of which may be set to any 12-hour position. There are therefore 12^(14) possible ...

A definable set which is the complement of an analytic set.