Search Results for ""

The complement of a graph G, sometimes called the edge-complement (Gross and Yellen 2006, p. 86), is the graph G^', sometimes denoted G^_ or G^c (e.g., Clark and Entringer ...

The homeomorphism group of a topological space X is the set of all homeomorphisms f:X->X, which forms a group by composition.

The map which assigns every member of a set A to the same element id_A. It is identical to the identity function.

Given a subset B of a set A, the injection f:B->A defined by f(b)=b for all b in B is called the inclusion map.

A set of graph vertices A of a graph with graph edges V is independent if it contains no graph edges.

"The integers" is a common way of referring to the set of integers, commonly denoted Z.

A relation R on a set S is irreflexive provided that no element is related to itself; in other words, xRx for no x in S.

Given a positive integer n, a labeled n-digraph is a digraph whose vertex set is {1,...,n}.

S_n=sum_(i)eta_imu(E_i), where mu(E_i) is the measure of the set E_i of points on the x-axis for which f(x) approx eta_i.

A set of points capable of being enclosed in intervals whose total length is arbitrarily small.