Search Results for ""

The clique covering number theta(G) of a graph G is the minimum number of cliques in G needed to cover the vertex set of G. Since theta(G) involves the minimum number of ...

The complete products of a Boolean algebra of subsets generated by a set {A_k}_(k=1)^p of cardinal number p are the 2^p Boolean functions B_1B_2...B_p=B_1 intersection B_2 ...

The n-crown graph for an integer n>=3 is the graph with vertex set {x_0,x_1,...,x_(n-1),y_0,y_1,...,y_(n-1)} (1) and edge set {(x_i,y_j):0<=i,j<=n-1,i!=j}. (2) It is ...

The study of definable sets and functions in polish spaces.

A symbol used to distinguish one quantity x^' ("x prime") from another related x. Prime marks are most commonly used to denote 1. Transformed coordinates, 2. Conjugate ...

Let G_1, G_2, ..., G_t be a t-graph edge coloring of the complete graph K_n, where for each i=1, 2, ..., t, G_i is the spanning subgraph of K_n consisting of all graph edges ...

This problem is NP-complete (Garey and Johnson 1983).

A topological two-sphere in three-space whose exterior is not simply connected. The outer complement of Antoine's horned sphere is not simply connected. Furthermore, the ...

A cograph (or "complement-reducible graph") is simple graph defined by the criteria 1. K_1 is a cograph, 2. If X is a cograph, then so is its graph complement, and 3. If X ...

Fredholm's theorem states that, if A is an m×n matrix, then the orthogonal complement of the row space of A is the null space of A, and the orthogonal complement of the ...