Search Results for ""

A connected dominating set in a connected graph G is a dominating set in G whose vertices induce a connected subgraph, i.e., one in which there is no dominating vertex not ...

Set covering deployment (sometimes written "set-covering deployment" and abbreviated SCDP for "set covering deployment problem") seeks an optimal stationing of troops in a ...

A RAT-free ("right angle triangle-free") set is a set of points, no three of which determine a right triangle. Let f(n) be the largest integer such that a RAT-free subset of ...

A union-closed set is a nonempty finite collection of distinct nonempty finite sets which is closed under union.

One of the Zermelo-Fraenkel axioms which asserts the existence for any set a of the power set x consisting of all the subsets of a. The axiom may be stated symbolically as ...

A lattice-ordered set is a poset (L,<=) in which each two-element subset {a,b} has an infimum, denoted inf{a,b}, and a supremum, denoted sup{a,b}. There is a natural ...

The low-level language of topology, which is not really considered a separate "branch" of topology. Point-set topology, also called set-theoretic topology or general ...

A set of residues {a_1,a_2,...,a_(k+1)} (mod n) such that every nonzero residue can be uniquely expressed in the form a_i-a_j. Examples include {1,2,4} (mod 7) and {1,2,5,7} ...

A subset S subset R^n is said to be pseudo-convex at a point x in S if the associated pseudo-tangent cone P_S(x) to S at x contains S-{x}, i.e., if S-{x} subset P_S(x). Any ...

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