Search Results for ""

A clique covering of a graph G is set of cliques such that every vertex of G is a member of at least one clique. A minimum clique covering is a clique covering of minimum ...

The clique graph of a given graph G is the graph intersection of the family of cliques of G. A graph G is a clique graph iff it contains a family F of complete subgraphs ...

A solitaire game played with cards. The chance of winning is 1/13, and the arithmetic mean of the number of cards turned up is 42.4.

A subset of a topological space is called clopen if it is both closed and open.

A mathematical structure A is said to be closed under an operation + if, whenever a and b are both elements of A, then so is a+b. A mathematical object taken together with ...

The closed ball with center x and radius r is defined by B_r(x)={y:|y-x|<=r}.

In the plane, a closed curve is a curve with no endpoints and which completely encloses an area.

An n-dimensional closed disk of radius r is the collection of points of distance <=r from a fixed point in n-dimensional Euclidean space. Krantz (1999, p. 3) uses the symbol ...

A map f between topological spaces that maps closed sets to closed sets. If f is bijective, then f is closed <==>f is open <==>f^(-1) is continuous, where f^(-1) denotes the ...

A linear operator A:D(A)->H from its domain D(A) into a Hilbert space H is closed if for any sequence of vectors v_n in D(A) such that v_n->v and Av_n->x as n->infty, it ...