Search Results for ""

The unitary group U_n(q) is the set of n×n unitary matrices.

A subgraph G^' of a graph G is a graph G^' whose vertex set and edge set are subsets of those of G. If G^' is a subgraph of G, then G is said to be a supergraph of G^' ...

An open connected set is called a region (sometimes also called a domain).

A relation R on a set S is transitive provided that for all x, y and z in S such that xRy and yRz, we also have xRz.

Let D be a set of positive numbers containing 1, then the D-distance graph X(D) on a nonempty subset X of Euclidean space is the graph with vertex set X and edge set ...

A set which contains a nonnegative integral number of elements is said to be finite. A set which is not finite is said to be infinite. A finite or countably infinite set is ...

An infinite set, such as the real numbers, which is not countably infinite.

A subset is a portion of a set. B is a subset of A (written B subset= A) iff every member of B is a member of A. If B is a proper subset of A (i.e., a subset other than the ...

A distance graph with distance set (0,1].

Model completion is a term employed when existential closure is successful. The formation of the complex numbers, and the move from affine to projective geometry, are ...