Search Results for ""

A countable set is a set that is either finite or denumerable. However, some authors (e.g., Ciesielski 1997, p. 64) use the definition "equipollent to the finite ordinals," ...

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 partially ordered set (or poset) is a set taken together with a partial order on it. Formally, a partially ordered set is defined as an ordered pair P=(X,<=), where X is ...

A set is a finite or infinite collection of objects in which order has no significance, and multiplicity is generally also ignored (unlike a list or multiset). Members of a ...

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

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

A set S in a vector space over R is called a convex set if the line segment joining any pair of points of S lies entirely in S.

A set S together with a relation >= which is both transitive and reflexive such that for any two elements a,b in S, there exists another element c in S with c>=a and c>=b. In ...

A set containing all elements of a smaller set. If B is a subset of A, then A is a superset of B, written A superset= B. If A is a proper superset of B, this is written A ...