Search Results for ""

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

A subset B of a vector space E is said to be absorbing if for any x in E, there exists a scalar lambda>0 such that x in muB for all mu in F with |mu|>=lambda, where F is the ...

A subset B of a vector space E is said to be balanced if lambdaB subset= B whenever lambda is a scalar satisfying |lambda|<=1. Here, the notation lambdaB denotes the set ...

Given a subset K of a vector space X, a nonempty subset S subset K is called an extreme set of K if no point of S is an internal point of any line interval whose endpoints ...

The axiom of Zermelo-Fraenkel set theory which asserts the existence for any set a of the sum (union) x of all sets that are elements of a. The axiom may be stated ...

A set S is said to be GCD-closed if GCD(x_i,x_j) in S for 1<=i,j<=n.

The comparability graph of a partially ordered set P=(X,<=) is the graph with vertex set X for which vertices x and y are adjacent iff either x<=y or y<=x in P.

An independent dominating set of a graph G is a set of vertices in G that is both an independent vertex set and a dominating set of G. The minimum size of an independent ...

A minimal dominating set is a dominating set in a graph that is not a proper subset of any other dominating set. Every minimum dominating set is a minimal dominating set, but ...

Let X be a set and S a collection of subsets of X. A subset A subset X is shattered by S if each subset B subset A of A can be expressed as the intersection of A with a ...