Search Results for ""

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

An independent vertex set of a graph G is a subset of the vertices such that no two vertices in the subset represent an edge of G. The figure above shows independent sets ...

The two-dimensional Hammersley point set of order m is defined by taking all numbers in the range from 0 to 2^m-1 and interpreting them as binary fractions. Calling these ...

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

A set of positive integers is called weakly triple-free if, for any integer x, the set {x,2x,3x} !subset= S. For example, all subsets of {1,2,3,4,5} are weakly triple-free ...

A set T of integers is said to be recursively enumerable if it constitutes the range of a recursive function, i.e., if there exists a recursive function that can eventually ...

A maximal sum-free set is a set {a_1,a_2,...,a_n} of distinct natural numbers such that a maximum l of them satisfy a_(i_j)+a_(i_k)!=a_m, for 1<=j<k<=l, 1<=m<=n.

An independent vertex set of a graph G is a subset of the vertices such that no two vertices in the subset represent an edge of G. Given a vertex cover of a graph, all ...

A set of positive integers is double-free if, for any integer x, the set {x,2x} !subset= S (or equivalently, x in S implies 2x not in S). For example, of the subsets of ...