Search Results for ""

The clique polynomial C_G(x) for the graph G is defined as the polynomial C_G(x)=1+sum_(k=1)^(omega(G))c_kx^k, (1) where omega(G) is the clique number of G, the coefficient ...

An equation is said to be a closed-form solution if it solves a given problem in terms of functions and mathematical operations from a given generally-accepted set. For ...

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

Also called Macaulay ring, a Cohen Macaulay ring is a Noetherian commutative unit ring R in which any proper ideal I of height n contains a sequence x_1, ..., x_n of elements ...

The American Mathematical Society awards two prizes named in honor of Prof. Frank Nelson Cole, a senior member of the AMS who made a bequest to the society in 1928 upon his ...

A column-convex polyomino is a self-avoiding convex polyomino such that the intersection of any vertical line with the polyomino has at most two connected components. ...

The figure determined by four lines, no three of which are concurrent, and their six points of intersection (Johnson 1929, pp. 61-62). Note that this figure is different from ...

A complete k-partite graph is a k-partite graph (i.e., a set of graph vertices decomposed into k disjoint sets such that no two graph vertices within the same set are ...

A matrix whose elements may contain complex numbers. The matrix product of two 2×2 complex matrices is given by (1) where R_(11) = ...

The theory of classifying problems based on how difficult they are to solve. A problem is assigned to the P-problem (polynomial-time) class if the number of steps needed to ...